Mathlib Map

Theorems · Theorem · combinatorics

Fin.insertNthEquiv_apply

∀ {n : ℕ} (α : Fin (n + 1) → Type u) (p : Fin (n + 1)) (f : α p × ((i : Fin n) → α (p.succAbove i))) (j : Fin (n + 1)),
  (Fin.insertNthEquiv α p) f j = p.insertNth f.1 f.2 j
Defined in
Mathlib.Data.Fin.Tuple.Basic
Cited by
3 results in Mathlib
Foundations
Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

MeasureTheory.measurePreserving_piFinSuccAbove · cited by 3MeasureTheory.measurePres…Finset.map_insertNthEquiv_filter_piFinset · cited by 1Finset.map_insertNthEquiv…Fin.insertNthEquiv_last · cited by 0Fin.insertNthEquiv_lastDFunLike.coe · cited by 62936DFunLike.coeEquiv · cited by 8337EquivFin.succAbove · cited by 249Fin.succAboveFin.insertNth · cited by 95Fin.insertNthFin.insertNthEquiv · cited by 14Fin.insertNthEquivFin.insertNthEquiv_applyCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.