Theorems · Theorem · group theory
finsum_mem_union
∀ {α : Type u_1} {M : Type u_5} [inst : AddCommMonoid M] {f : α → M} {s t : Set α},
Disjoint s t →
s.Finite → t.Finite → ∑ᶠ (i : α) (_ : i ∈ s ∪ t), f i = ∑ᶠ (i : α) (_ : i ∈ s), f i + ∑ᶠ (i : α) (_ : i ∈ t), f iGiven two finite disjoint sets s and t, the sum of f i over i ∈ s ∪ t equals
the sum of f i over i ∈ s plus the sum of f i over i ∈ t.
- Defined in
- Mathlib.Algebra.BigOperators.Finprod
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 86 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- AddCommMonoidstatement and proof · cited by 12,281
- Disjointstatement and proof · cited by 2,201
- Set.Finitestatement and proof · cited by 1,814
- Function.supportproof · cited by 610
- finsumstatement · cited by 286
- Set.Finite.inter_of_leftproof · cited by 31
- finsum_mem_union'proof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- finsum_mem_powerset_insertproof · cited by 1
- finsum_mem_union''proof · cited by 0