Theorems · Theorem · group theory
Finset.sum_biUnion_of_pairwise_eq_zero
∀ {ι : Type u_1} {κ : Type u_2} {M : Type u_4} [inst : AddCommMonoid M] {f : ι → M} [inst_1 : DecidableEq ι]
{s : Finset κ} {t : κ → Finset ι},
((↑s).Pairwise fun i j => ∀ k ∈ t i ∩ t j, f k = 0) → ∑ x ∈ s.biUnion t, f x = ∑ x ∈ s, ∑ i ∈ t x, f i- Cited by
- 0 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoidDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- AddCommMonoidstatement and proof · cited by 12,281
- SetLike.coestatement and proof · cited by 8,199
- Finset.sumstatement and proof · cited by 5,195
- Finset.sum_congrproof · cited by 2,323
- Finset.filterproof · cited by 949
- Set.Pairwisestatement and proof · cited by 321
- Finset.biUnionstatement and proof · cited by 217
- Finset.mem_filterproof · cited by 185
- Finset.filter_congrproof · cited by 167
- Finset.sum_filter_ne_zeroproof · cited by 14
- Finset.sum_biUnionproof · cited by 10
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.