Theorems · Theorem · order theory
Multiset.count_nsmul
∀ {α : Type u_1} [inst : DecidableEq α] (a : α) (n : ℕ) (s : Multiset α),
Multiset.count a (n • s) = n * Multiset.count a s- Defined in
- Mathlib.Algebra.Order.Group.Multiset
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 55 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.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetstatement and proof · cited by 2,627
- Multiset.countstatement and proof · cited by 302
- zero_nsmulproof · cited by 137
- succ_nsmulproof · cited by 65
- Multiset.count_eq_zero_of_notMemproof · cited by 27
- Multiset.count_addproof · cited by 23
- Multiset.count.congr_simpproof · cited by 22
Cited by10
Results whose statement or proof uses this declaration.
- Finsupp.count_toMultisetproof · cited by 10
- Polynomial.roots_expand_powproof · cited by 3
- Multiset.le_card_smul_iff_subsetproof · cited by 2
- Ideal.ramificationIdx'_algebra_towerproof · cited by 2
- Polynomial.roots_expand_pow_map_iterateFrobenius_leproof · cited by 2
- ChevalleyThm.chevalley_mvPolynomialCproof · cited by 1
- Multiset.toFinset_eq_singleton_iffproof · cited by 0
- Sym.coe_equivNatSumOfFintype_symm_applyproof · cited by 0
- Finset.map_sym_eq_piAntidiagproof · cited by 0
- chevalley_mvPolynomial_mvPolynomialproof · cited by 0