Theorems · Theorem · combinatorics
Finset.Colex.singleton_le_singleton
∀ {α : Type u_1} [inst : PartialOrder α] {a b : α}, toColex {a} ≤ toColex {b} ↔ a ≤ bColex is an extension of the base order.
- Defined in
- Mathlib.Combinatorics.Colex
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Finsetstatement · cited by 13,712
- Equivstatement · cited by 8,337
- PartialOrderstatement and proof · cited by 6,410
- Colexstatement · cited by 131
- toColexstatement · cited by 90
Cited by2
Results whose statement or proof uses this declaration.
- Finset.Colex.cons_le_consproof · cited by 2
- Finset.Colex.erase_le_eraseproof · cited by 2