Theorems · Theorem · order theory
Finset.orderEmbOfFin_compl_singleton_apply
∀ {n : ℕ} {i : Fin (n + 1)} {k : ℕ} (h : {i}ᶜ.card = k) (j : Fin k),
({i}ᶜ.orderEmbOfFin h) j = i.succAbove (Fin.cast ⋯ j)- Defined in
- Mathlib.Data.Finset.Sort
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · 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 and proof · cited by 619
- Fin.succAbovestatement and proof · cited by 249
- Finset.orderEmbOfFinstatement · cited by 47
- Fin.succAboveOrderEmbproof · cited by 15
- Fin.succAboveOrderEmb_applyproof · cited by 10
- Fin.castOrderIso_applyproof · cited by 4
- Finset.orderEmbOfFin_compl_singletonproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Affine.Simplex.faceOpposite_point_eq_point_succAboveproof · cited by 1