Theorems · Definition · order theory
Fin.succAboveOrderIso
{n : ℕ} → (i : Fin (n + 2)) → Fin (n + 1) ≃o ↥{i}ᶜGiven i : Fin (n + 2), this is the order isomorphism
between Fin (n + 1) and the finite set {i}ᶜ.
- Defined in
- Mathlib.Order.Fin.SuccAboveOrderIso
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsetstatement · cited by 13,712
- Equivproof · cited by 8,337
- Compl.complstatement and proof · cited by 2,925
- OrderIsostatement · cited by 874
- Equiv.ofBijectiveproof · cited by 70
- Fin.succAboveOrderEmbproof · cited by 15
Cited by1
Results whose statement or proof uses this declaration.
- SSet.stdSimplex.ofSimplex_yonedaEquiv_δproof · cited by 1