Mathlib Map

Theorems · Theorem · combinatorics

Fin.forall_fin_succ_pi

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

Around this declaration

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

Fin.cons · cited by 190Fin.consFin.consCases · cited by 4Fin.consCasesFin.forall_fin_succ_piCITED BYCITES

Cites2

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.