Theorems · Definition · combinatorics
Multiset
Type u → Type u
Multiset α is the quotient of List α by list permutation. The result
is a type of finite sets with duplicates allowed.
- Defined in
- Mathlib.Data.Multiset.Defs
- Cited by
- 2,627 results in Mathlib
- Foundations
- Depth 9 from the axioms, rests on 18 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by2,881
Results whose statement or proof uses this declaration.
- Multiset.mapstatement and proof · cited by 876
- Multiset.prodstatement · cited by 528
- Finset.valstatement · cited by 438
- Multiset.sumstatement · cited by 388
- Multiset.cardstatement · cited by 375
- Multiset.consstatement and proof · cited by 313
- Multiset.countstatement · cited by 302
- Multiset.ofListstatement · cited by 290
- Polynomial.rootsstatement · cited by 264
- Multiset.map_congrstatement and proof · cited by 232
- Multiset.toFinsetstatement and proof · cited by 230
- DFinsupp.supportproof · cited by 158
Showing the 200 most cited of 2,881.