Theorems · Theorem · order theory
Finpartition.card_mono
∀ {α : Type u_1} [inst : Lattice α] [inst_1 : OrderBot α] {a : α} {P Q : Finpartition a},
P ≤ Q → Q.parts.card ≤ P.parts.card- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 80 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.
- SetLike.coeproof · cited by 8,199
- LE.le.transproof · cited by 3,151
- Finset.cardstatement and proof · cited by 2,327
- Disjointproof · cited by 2,201
- OrderBotstatement and proof · cited by 1,055
- Latticestatement and proof · cited by 916
- Eq.leproof · cited by 605
- Subtype.coe_injectiveproof · cited by 205
- Finpartitionstatement and proof · cited by 199
- Finpartition.partsstatement and proof · cited by 184
- Finset.attachproof · cited by 168
- Disjoint.monoproof · cited by 69
Cited by1
Results whose statement or proof uses this declaration.
- Finpartition.card_parts_le_cardproof · cited by 4