Theorems · Theorem · combinatorics
Fin.insertNth_inj
∀ {n : ℕ} {α : Fin (n + 1) → Sort u_1} {p : Fin (n + 1)} {x y : (i : Fin n) → α (p.succAbove i)} {xₚ yₚ : α p},
p.insertNth xₚ x = p.insertNth yₚ y ↔ xₚ = yₚ ∧ x = y- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 0 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.
Cites4
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
- Function.Injective2.eq_iffproof · cited by 9
- Fin.insertNth_injective2proof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.