Theorems · Theorem · combinatorics
Fin.insertNth_injective2
∀ {n : ℕ} {α : Fin (n + 1) → Sort u_1} {p : Fin (n + 1)}, Function.Injective2 p.insertNthAs a binary function, Fin.insertNth is injective.
- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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 and proof · cited by 95
- Fin.insertNth_apply_sameproof · cited by 30
- Function.Injective2statement · cited by 23
- Fin.insertNth_apply_succAboveproof · cited by 23
Cited by3
Results whose statement or proof uses this declaration.
- Fin.insertNth_right_injectiveproof · cited by 0
- Fin.insertNth_left_injectiveproof · cited by 0
- Fin.insertNth_injproof · cited by 0