Theorems · Theorem · combinatorics
Finset.Colex.toColex_mono
∀ {α : Type u_1} [inst : PartialOrder α], Monotone ⇑toColexIf s ⊆ t, then s ≤ t in the colex order. Note the converse does not hold, as inclusion does
not form a linear order.
- Defined in
- Mathlib.Combinatorics.Colex
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 65 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.
Cites8
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 and proof · cited by 13,712
- Equivstatement · cited by 8,337
- PartialOrderstatement and proof · cited by 6,410
- Monotonestatement · cited by 1,397
- Colexstatement · cited by 131
- toColexstatement and proof · cited by 90
- ofColexproof · cited by 51
Cited by2
Results whose statement or proof uses this declaration.
- Finset.Colex.toColex_strictMonoproof · cited by 1
- Finset.Colex.toColex_le_toColex_of_subsetproof · cited by 0