Theorems · Theorem · group theory
Multiset.support_fun_nsmul_count_subset
∀ {α : Type u_1} {M : Type u_2} [inst : DecidableEq α] [inst_1 : AddCommMonoid M] (s : Multiset α) (f : α → M),
(Function.support fun a => Multiset.count a s • f a) ⊆ ↑s.toFinset- Defined in
- Mathlib.Algebra.BigOperators.Finprod
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- SetLike.coestatement · cited by 8,199
- Multisetstatement and proof · cited by 2,627
- Function.supportstatement · cited by 610
- SetLike.mem_coeproof · cited by 302
- Multiset.countstatement and proof · cited by 302
- Multiset.toFinsetstatement · cited by 230
- zero_nsmulproof · cited by 137
- not_imp_commproof · cited by 56
- Multiset.mem_toFinsetproof · cited by 39
Cited by2
Results whose statement or proof uses this declaration.
- Multiset.hasFiniteSupport_fun_nsmul_countproof · cited by 0
- Multiset.sum_map_eq_finsumproof · cited by 0