Theorems · Theorem · order theory
Finpartition.card_bot
∀ {α : Type u_1} [inst : DecidableEq α] (s : Finset α), ⊥.parts.card = s.card- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 80 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.
Cites7
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
- Bot.botstatement · cited by 4,720
- Finset.cardstatement · cited by 2,327
- Finpartitionstatement · cited by 199
- Finpartition.partsstatement · cited by 184
- Finset.card_mapproof · cited by 114
- Finset.singleton_injectiveproof · cited by 14
Cited by3
Results whose statement or proof uses this declaration.
- Finpartition.card_parts_le_cardproof · cited by 4
- szemeredi_regularityproof · cited by 1
- Finpartition.bot_isUniformproof · cited by 1