Theorems · Definition · combinatorics
Multiset.toFinset
{α : Type u_1} → [DecidableEq α] → Multiset α → Finset αtoFinset s removes duplicates from the multiset s to produce a finset.
- Defined in
- Mathlib.Data.Finset.Dedup
- Cited by
- 230 results in Mathlib
- Foundations
- Depth 72 from the axioms, rests on 1,339 definitions · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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.dedupproof · cited by 59
- Multiset.nodup_dedupproof · cited by 3
Cited by259
Results whose statement or proof uses this declaration.
- Finset.imageproof · cited by 910
- Finset.biUnionproof · cited by 217
- DFinsupp.supportproof · cited by 158
- List.toFinsetproof · cited by 108
- Polynomial.rootSetproof · cited by 101
- MvPolynomial.varsproof · cited by 79
- primitiveRootsproof · cited by 57
- Polynomial.natSepDegreeproof · cited by 53
- Multiset.mem_toFinsetstatement · cited by 39
- Multiset.toFinsuppproof · cited by 33
- Finset.card_image_leproof · cited by 33
- UniqueFactorizationMonoid.primeFactorsproof · cited by 32
Showing the 200 most cited of 259.