Theorems · Theorem · combinatorics
Fin.insertNth_apply_same
∀ {n : ℕ} {α : Fin (n + 1) → Sort u_1} (i : Fin (n + 1)) (x : α i) (p : (j : Fin n) → α (i.succAbove j)),
i.insertNth x p i = x- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 30 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.succAbovestatement and proof · cited by 249
- Fin.insertNthstatement · cited by 95
Cited by30
Results whose statement or proof uses this declaration.
- Fin.insertNth_eq_iffproof · cited by 6
- Fin.insertNth_binopproof · cited by 4
- Fin.insertNth_injective2proof · cited by 3
- MeasureTheory.measurePreserving_piFinSuccAboveproof · cited by 3
- Fin.insertNth_revproof · cited by 3
- Filter.Tendsto.finInsertNthproof · cited by 2
- Fin.insertNth_apply_cycleRange_symmproof · cited by 2
- MeasureTheory.integral_eq_of_hasDerivAt_off_countable_of_leproof · cited by 1
- finSuccEquiv'_atproof · cited by 1
- Fin.nndist_insertNth_insertNthproof · cited by 1
- Finset.map_insertNthEquiv_filter_piFinsetproof · cited by 1