Theorems · Definition · combinatorics
Multiset.dedup
{α : Type u_1} → [DecidableEq α] → Multiset α → Multiset αdedup s removes duplicates from s, yielding a nodup multiset.
- Defined in
- Mathlib.Data.Multiset.Dedup
- Cited by
- 59 results in Mathlib
- Foundations
- Depth 70 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.
- Multisetstatement and proof · cited by 2,627
- Multiset.ofListproof · cited by 290
- List.dedupproof · cited by 47
Cited by61
Results whose statement or proof uses this declaration.
- Multiset.toFinsetproof · cited by 230
- Finset.image_imageproof · cited by 16
- Multiset.Nodup.dedupstatement · cited by 15
- Multiset.dedup_extstatement · cited by 12
- Multiset.dedup_eq_selfstatement and proof · cited by 9
- Multiset.dedup_lestatement · cited by 9
- Multiset.toFinset_valstatement · cited by 8
- Finset.attach_image_valproof · cited by 6
- Nat.Partition.ofSymproof · cited by 6
- Multiset.subset_dedupstatement · cited by 5
- Finset.image_valstatement · cited by 5
- Multiset.mem_dedupstatement · cited by 5