Theorems · Theorem · group theory
Finset.sum_ite_mem_eq
∀ {ι : Type u_1} {M : Type u_4} [inst : AddCommMonoid M] [inst_1 : Fintype ι] (s : Finset ι) (f : ι → M)
[inst_2 : DecidablePred fun x => x ∈ s], (∑ i, if i ∈ s then f i else 0) = ∑ i ∈ s, f i- Cited by
- 2 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- Fintypestatement and proof · cited by 7,736
- Finset.sumstatement and proof · cited by 5,195
- Finset.univstatement and proof · cited by 3,473
- Finset.filterproof · cited by 949
- Finset.sum_filterproof · cited by 37
Cited by2
Results whose statement or proof uses this declaration.
- Finset.sum_fin_Icc_eq_sum_nat_Iccproof · cited by 1
- Fin.sum_Iic_subproof · cited by 0