Theorems · Theorem · group theory
Finset.sum_list_map_count
∀ {ι : Type u_1} {M : Type u_4} [inst : AddCommMonoid M] [inst_1 : DecidableEq ι] (l : List ι) (f : ι → M),
(List.map f l).sum = ∑ m ∈ l.toFinset, List.count m l • f m- Cited by
- 3 results in Mathlib
- Foundations
- Depth 77 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.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- Finset.sumstatement and proof · cited by 5,195
- Finset.sum_congrproof · cited by 2,323
- add_assocproof · cited by 746
- Finset.eraseproof · cited by 455
- Finset.sum_const_zeroproof · cited by 219
- Finset.sum_insertproof · cited by 196
- zero_nsmulproof · cited by 137
- List.toFinsetstatement and proof · cited by 108
- Finset.insert_eraseproof · cited by 65
- one_nsmulproof · cited by 63
Cited by3
Results whose statement or proof uses this declaration.
- Finset.sum_multiset_map_countproof · cited by 10
- List.sum_toFinset_count_eq_lengthproof · cited by 1
- Finset.sum_list_countproof · cited by 1