Theorems · Definition · combinatorics
Fin.cons
{n : ℕ} → {α : Fin (n + 1) → Sort u} → α 0 → ((i : Fin n) → α i.succ) → (i : Fin (n + 1)) → α iAdding an element at the beginning of an n-tuple, to get an n+1-tuple.
- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 190 results in Mathlib
- Foundations
- Depth 30 from the axioms, rests on 162 definitions · uses propext
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 by201
Results whose statement or proof uses this declaration.
- Matrix.vecConsproof · cited by 852
- Fin.cons_succstatement · cited by 54
- Fin.cons_zerostatement · cited by 53
- Finsupp.consproof · cited by 29
- piFinTwoEquivproof · cited by 19
- Fin.consEquivproof · cited by 18
- Fin.cons_onestatement and proof · cited by 10
- Fin.cons_self_tailstatement · cited by 9
- HasFTaylorSeriesUpToOn.hasFDerivWithinAtproof · cited by 6
- hasFDerivAtFilter_finConsstatement and proof · cited by 6
- Fin.insertNth_zero'statement and proof · cited by 5
- MultilinearMap.curryLeftproof · cited by 5
Showing the 200 most cited of 201.