Theorems · Definition · combinatorics
Fin.init
{n : ℕ} → {α : Fin (n + 1) → Sort u_1} → ((i : Fin (n + 1)) → α i) → (i : Fin n) → α i.castSuccThe beginning of an n+1 tuple, i.e., its first n entries
- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 49 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by53
Results whose statement or proof uses this declaration.
- Fin.snocEquivproof · cited by 7
- Fin.snoc_init_selfstatement and proof · cited by 7
- Fin.init_snocstatement · cited by 6
- contDiffWithinAt_succ_iff_hasFDerivWithinAtproof · cited by 5
- iteratedFDeriv_succ_apply_rightstatement and proof · cited by 4
- Fin.snocCasesproof · cited by 4
- MultilinearMap.uncurryRightproof · cited by 3
- iteratedFDeriv_succ_eq_comp_rightproof · cited by 3
- Fin.Embedding.initproof · cited by 3
- iteratedFDerivWithin_succ_apply_rightstatement and proof · cited by 3
- iteratedFDerivWithin_two_applyproof · cited by 3
- hasFTaylorSeriesUpToOn_succ_nat_iff_rightproof · cited by 2