Theorems · Theorem · combinatorics
Fin.insertNth_zero
∀ {n : ℕ} {α : Fin (n + 1) → Sort u_1} (x : α 0) (p : (j : Fin n) → α (Fin.succAbove 0 j)),
Fin.insertNth 0 x p = Fin.cons x fun j => cast ⋯ (p j)- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fin.succAbovestatement and proof · cited by 249
- Fin.consstatement and proof · cited by 190
- Fin.insertNthstatement · cited by 95
- Fin.cons_succproof · cited by 54
- Fin.cons_zeroproof · cited by 53
- Fin.removeNthproof · cited by 53
- Fin.succAbove_zerostatement and proof · cited by 7
- Fin.insertNth_eq_iffproof · cited by 6
Cited by3
Results whose statement or proof uses this declaration.
- Fin.insertNth_zero'proof · cited by 5
- MeasureTheory.integral_fin_nat_prod_eq_prodproof · cited by 2
- MeasureTheory.Integrable.fin_nat_prodproof · cited by 1