Theorems · Theorem · combinatorics
Fin.ne_last_of_lt
∀ {n : ℕ} {a b : Fin (n + 1)}, a < b → a ≠ Fin.last n- Defined in
- Mathlib.Data.Fin.Basic
- Cited by
- 25 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by25
Results whose statement or proof uses this declaration.
- Fin.insertNth_apply_succAboveproof · cited by 23
- Fin.predAbove_of_lt_succstatement · cited by 3
- Fin.succ_predAbove_succproof · cited by 2
- SSet.stdSimplex.facePairComplIso_hom_ιstatement · cited by 2
- SSet.stdSimplex.facePairComplIso_hom_ι'proof · cited by 2
- SSet.horn.IsCompatible.of_homproof · cited by 1
- SSet.horn.IsCompatible.δ_pred_compstatement · cited by 1
- Fin.predAbove_succ_of_ltproof · cited by 1
- SimplexCategory.δ_comp_toMk₁_of_lestatement and proof · cited by 1
- SSet.prodStdSimplex.pairingCore.IsType₂.strictMono_φproof · cited by 1
- Fin.castPred_succAbovestatement · cited by 1
- SSet.stdSimplex.homOfLE_faceSingletonComplIso_inv_eq_facePairComplIso_inv_δ_castPredstatement and proof · cited by 1