Theorems · Theorem · combinatorics
Set.Subsingleton.isEquipartition
∀ {α : Type u_1} [inst : DecidableEq α] {s : Finset α} {P : Finpartition s}, (↑P.parts).Subsingleton → P.IsEquipartition- Defined in
- Mathlib.Order.Partition.Equipartition
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 58 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.
Cites8
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
- SetLike.coestatement and proof · cited by 8,199
- Finset.cardproof · cited by 2,327
- Set.Subsingletonstatement and proof · cited by 276
- Finpartitionstatement and proof · cited by 199
- Finpartition.partsstatement and proof · cited by 184
- Finpartition.IsEquipartitionstatement · cited by 45
- Set.Subsingleton.equitableOnproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Finpartition.top_isEquipartitionproof · cited by 0