Theorems · Theorem · order theory
Finpartition.card_mod_card_parts_le
∀ {α : Type u_1} [inst : DecidableEq α] {s : Finset α} (P : Finpartition s), s.card % P.parts.card ≤ P.parts.card- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.cardstatement and proof · cited by 2,327
- LT.lt.leproof · cited by 2,189
- le_reflproof · cited by 2,061
- Finpartitionstatement and proof · cited by 199
- Finpartition.partsstatement and proof · cited by 184
- Finset.card_eq_zeroproof · cited by 34
- Finset.bot_eq_emptyproof · cited by 3
- Finpartition.parts_eq_empty_iffproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Finpartition.IsEquipartition.exists_partsEquivproof · cited by 1