Theorems · Theorem · combinatorics
Fin.cons_one
∀ {n : ℕ} {α : Fin (n + 2) → Sort u_1} (x : α 0) (p : (i : Fin n.succ) → α i.succ), Fin.cons x p 1 = p 0- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 32 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fin.consstatement and proof · cited by 190
- Fin.cons_succproof · cited by 54
Cited by10
Results whose statement or proof uses this declaration.
- iteratedDerivWithin_vcomp_threeproof · cited by 2
- Fin.preimage_apply_01_prodproof · cited by 2
- FirstOrder.realize_genericPolyMapSurjOnOfInjOnproof · cited by 2
- Convexity.convexCombPair_iConvexComb_iConvexCombproof · cited by 2
- ContinuousAlternatingMap.curryLeft_sameproof · cited by 0
- FirstOrder.Language.presburger.mul_not_definableproof · cited by 0
- Fin.insertNth_zero_monotoneproof · cited by 0
- Fin.strictMono_insertNth_zeroproof · cited by 0
- AlternatingMap.curryLeft_sameproof · cited by 0
- Nat.image_piFinTwoEquiv_finMulAntidiagproof · cited by 0