Theorems · Theorem · order theory
Multiset.toFinset_nsmul
∀ {α : Type u_1} [inst : DecidableEq α] (s : Multiset α) (n : ℕ), n ≠ 0 → (n • s).toFinset = s.toFinset- Defined in
- Mathlib.Algebra.Order.Group.Finset
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 77 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.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Multisetstatement and proof · cited by 2,627
- Multiset.toFinsetstatement · cited by 230
Cited by8
Results whose statement or proof uses this declaration.
- Polynomial.natSepDegree_powproof · cited by 4
- UniqueFactorizationMonoid.primeFactors_powproof · cited by 2
- Polynomial.rootSet_monomialproof · cited by 1
- Polynomial.roots_expand_pow_image_iterateFrobenius_subsetproof · cited by 1
- Finsupp.toFinset_toMultisetproof · cited by 1
- Multiset.toFinset_eq_singleton_iffproof · cited by 0
- Polynomial.roots_expand_image_frobeniusproof · cited by 0
- Polynomial.roots_expand_image_iterateFrobeniusproof · cited by 0