Theorems · Theorem · order theory
Multiset.dedup_nsmul
∀ {α : Type u_1} [inst : DecidableEq α] {s : Multiset α} {n : ℕ}, n ≠ 0 → (n • s).dedup = s.dedup- Defined in
- Mathlib.Algebra.Order.Group.Multiset
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 73 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.
Cites5
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.dedupstatement · cited by 59
- Multiset.ext'proof · cited by 31
- Multiset.count_eq_zero_of_notMemproof · cited by 27
- Multiset.count_eq_one_of_memproof · cited by 8
Cited by2
Results whose statement or proof uses this declaration.
- Multiset.extract_gcdproof · cited by 0
- Multiset.Nodup.le_nsmul_iff_leproof · cited by 0