Theorems · Theorem · combinatorics
Finset.disjUnion_eq_union
∀ {α : Type u_1} [inst : DecidableEq α] (s t : Finset α) (h : Disjoint s t), s.disjUnion t h = s ∪ t- Defined in
- Mathlib.Data.Finset.Basic
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 64 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.
Cites3
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
- Disjointstatement and proof · cited by 2,201
- Finset.disjUnionstatement · cited by 55
Cited by12
Results whose statement or proof uses this declaration.
- Finset.dens_union_of_disjointproof · cited by 3
- Finset.card_Icc_finsetproof · cited by 3
- IsCompl.prod_mul_prodproof · cited by 2
- IsCompl.sum_add_sumproof · cited by 2
- Set.Intersecting.is_max_iff_card_eqproof · cited by 2
- Finset.Ioi_disjUnion_Iioproof · cited by 1
- UniqueFactorizationMonoid.primeFactors_mul_eq_disjUnionproof · cited by 1
- Finset.Icc_eq_image_powersetproof · cited by 0
- Int.mem_divisorsAntidiagproof · cited by 0
- Int.mem_divisors_iff_natAbs_mem_divisors_natAbsproof · cited by 0
- Finset.sym2_insertproof · cited by 0
- Finset.box_succ_disjUnionproof · cited by 0