Theorems · Theorem · order theory
Finset.card_disjSups_le
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : SemilatticeSup α] [inst_2 : OrderBot α]
[inst_3 : DecidableRel Disjoint] (s t : Finset α), (s.disjSups t).card ≤ s.card * t.card- Defined in
- Mathlib.Data.Finset.Sups
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- LE.le.transproof · cited by 3,151
- Finset.cardstatement · cited by 2,327
- Disjointstatement and proof · cited by 2,201
- OrderBotstatement and proof · cited by 1,055
- SemilatticeSupstatement and proof · cited by 785
- Finset.card_le_cardproof · cited by 118
- Finset.disjSupsstatement · cited by 22
- Finset.card_sups_leproof · cited by 1
- Finset.disjSups_subset_supsproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.