Theorems · Theorem · combinatorics
Set.Intersecting.card_le
∀ {α : Type u_1} [inst : BooleanAlgebra α] [inst_1 : Fintype α] {s : Finset α},
(↑s).Intersecting → 2 * s.card ≤ Fintype.card α- Cited by
- 3 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- BooleanAlgebraFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
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
- Fintypestatement and proof · cited by 7,736
- Compl.complproof · cited by 2,925
- Finset.cardstatement and proof · cited by 2,327
- Fintype.cardstatement · cited by 1,386
- Finset.mapproof · cited by 747
- BooleanAlgebrastatement and proof · cited by 300
- Finset.card_mapproof · cited by 114
- Finset.disjUnionproof · cited by 55
- Finset.card_le_univproof · cited by 32
- Set.Intersectingstatement and proof · cited by 22
Cited by3
Results whose statement or proof uses this declaration.
- Set.Intersecting.is_max_iff_card_eqproof · cited by 2
- Set.Intersecting.exists_card_eqproof · cited by 1
- Finset.card_biUnion_le_of_intersectingproof · cited by 0