Theorems · Theorem · combinatorics
Finset.card_union_le
∀ {α : Type u_1} [inst : DecidableEq α] (s t : Finset α), (s ∪ t).card ≤ s.card + t.card- Defined in
- Mathlib.Data.Finset.Card
- Cited by
- 18 results in Mathlib
- Foundations
- Depth 68 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.
Cites2
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 · cited by 2,327
Cited by18
Results whose statement or proof uses this declaration.
- Finset.card_biUnion_leproof · cited by 8
- hammingDist_triangleproof · cited by 2
- MeasureTheory.Measure.haar.index_union_leproof · cited by 2
- alternatingGroup.coe_two_sylow_of_card_eq_fourproof · cited by 2
- MeasureTheory.Measure.haar.addIndex_union_leproof · cited by 2
- SSet.horn_obj_eq_univproof · cited by 2
- addRothNumber_union_leproof · cited by 1
- Nat.Ico_filter_coprime_leproof · cited by 1
- Ideal.height_le_height_add_of_liesOverproof · cited by 1
- SimpleGraph.triangle_counting'proof · cited by 1
- SimpleGraph.regularityReduced_edges_card_auxproof · cited by 1
- Nat.primeCounting'_add_leproof · cited by 1