Theorems · Theorem · order theory
Finset.orderEmbOfFin_compl_singleton
∀ {n : ℕ} {i : Fin (n + 1)} {k : ℕ} (h : {i}ᶜ.card = k),
{i}ᶜ.orderEmbOfFin h = RelEmbedding.trans (Fin.castOrderIso ⋯).toOrderEmbedding i.succAboveOrderEmb- Defined in
- Mathlib.Data.Finset.Sort
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
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
- Compl.complstatement and proof · cited by 2,925
- Finset.cardstatement and proof · cited by 2,327
- OrderEmbeddingstatement · cited by 619
- Fintype.card_finproof · cited by 270
- Fin.succAboveproof · cited by 249
- DFunLike.coe_injectiveproof · cited by 161
- Finset.card_singletonproof · cited by 144
- Finset.orderEmbOfFinstatement and proof · cited by 47
- StrictMono.compproof · cited by 36
- Finset.card_complproof · cited by 34
Cited by2
Results whose statement or proof uses this declaration.
- Finset.orderEmbOfFin_compl_singleton_applyproof · cited by 1
- Finset.orderEmbOfFin_compl_singleton_eq_succAboveOrderEmbproof · cited by 0