Theorems · Theorem · group theory
Finset.sum_filter_of_ne
∀ {ι : Type u_1} {M : Type u_4} {s : Finset ι} [inst : AddCommMonoid M] {f : ι → M} {p : ι → Prop}
[inst_1 : DecidablePred p], (∀ x ∈ s, f x ≠ 0 → p x) → ∑ x ∈ s with p x, f x = ∑ x ∈ s, f x- Cited by
- 11 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoidDecidablePred
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.
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- Finset.sumstatement · cited by 5,195
- Finset.filterstatement · cited by 949
- Finset.mem_filterproof · cited by 185
- Finset.sum_subsetproof · cited by 79
- not_imp_commproof · cited by 56
- Finset.filter_subsetproof · cited by 55
Cited by11
Results whose statement or proof uses this declaration.
- Finset.sum_filter_ne_zeroproof · cited by 14
- Finset.sum_preimageproof · cited by 6
- MvPowerSeries.coeff_mul_monomialproof · cited by 5
- MeasureTheory.SimpleFunc.setToSimpleFunc_eq_sum_filterproof · cited by 4
- MvPowerSeries.coeff_monomial_mulproof · cited by 3
- AffineIndependent.affineIndependent_of_notMem_spanproof · cited by 2
- Finset.weightedVSubOfPoint_filter_of_neproof · cited by 2
- LinearMap.trace_restrict_eq_of_forall_memproof · cited by 1
- StrictConvexOn.map_sum_eq_iff'proof · cited by 1
- eq_pos_convex_span_of_mem_convexHullproof · cited by 0
- Finsupp.linearCombination_onFinsetproof · cited by 0