Mathlib Map

Theorems · Theorem · combinatorics

Fin.exists_fin_succ_pi

∀ {n : ℕ} {α : Fin (n + 1) → Sort u} {P : ((i : Fin (n + 1)) → α i) → Prop}, (∃ x, P x) ↔ ∃ a v, P (Fin.cons a v)
Defined in
Mathlib.Data.Fin.Tuple.Basic
Cited by
1 results in Mathlib
Foundations
Depth 33 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Set.mem_sum_list_ofFn · cited by 3Set.mem_sum_list_ofFnFin.cons · cited by 190Fin.consFin.tail · cited by 74Fin.tailFin.cons_self_tail · cited by 9Fin.cons_self_tailFin.exists_fin_succ_piCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.