Theorems · Theorem · group theory
Multiset.sum_count_eq_card
∀ {ι : Type u_1} [inst : DecidableEq ι] {s : Finset ι} {m : Multiset ι},
(∀ a ∈ m, a ∈ s) → ∑ a ∈ s, Multiset.count a m = m.card- Cited by
- 3 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
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
- AddCommMonoidproof · cited by 12,281
- Finset.sumstatement and proof · cited by 5,195
- Multisetstatement and proof · cited by 2,627
- Finset.filterproof · cited by 949
- Finset.extproof · cited by 565
- Multiset.cardstatement · cited by 375
- Multiset.countstatement and proof · cited by 302
- Multiset.toFinsetproof · cited by 230
- Finset.filter_congrproof · cited by 167
- Finset.sum_filter_ne_zeroproof · cited by 14
- Multiset.toFinset_sum_count_eqproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- Polynomial.norm_coeff_le_choose_mul_mahlerMeasureproof · cited by 3
- Finset.map_sym_eq_piAntidiagproof · cited by 0
- Finset.sum_count_of_mem_symproof · cited by 0