Theorems · Theorem · combinatorics
Finset.card_union_eq_card_add_card
∀ {α : Type u_1} {s t : Finset α} [inst : DecidableEq α], (s ∪ t).card = s.card + t.card ↔ Disjoint s t- Defined in
- Mathlib.Data.Finset.Card
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 67 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.
Cites4
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 and proof · cited by 2,327
- Disjointstatement and proof · cited by 2,201
- Finset.card_union_add_card_interproof · cited by 14
Cited by1
Results whose statement or proof uses this declaration.
- Finset.card_union_of_disjointproof · cited by 37