Theorems · Theorem · group theory
Finset.sum_list_count
∀ {M : Type u_4} [inst : AddCommMonoid M] [inst_1 : DecidableEq M] (s : List M),
s.sum = ∑ m ∈ s.toFinset, List.count m s • m- Cited by
- 1 results in Mathlib
- Foundations
- Depth 78 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.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AddCommMonoidstatement and proof · cited by 12,281
- Finset.sumstatement · cited by 5,195
- Finset.sum_congrproof · cited by 2,323
- List.toFinsetstatement and proof · cited by 108
- Finset.sum_list_map_countproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Finset.sum_list_count_of_subsetproof · cited by 1