Theorems · Definition · combinatorics
Multiset.Nodup
{α : Type u_1} → Multiset α → PropNodup s means that s has no duplicates, i.e. the multiplicity of
any element is at most 1.
- Defined in
- Mathlib.Data.Multiset.Defs
- Cited by
- 148 results in Mathlib
- Foundations
- Depth 22 from the axioms, rests on 118 definitions · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
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
Cited by161
Results whose statement or proof uses this declaration.
- Finset.cons_inductionproof · cited by 85
- Finset.eq_of_veqproof · cited by 45
- Finset.nodupstatement · cited by 40
- Finset.mem_powersetproof · cited by 26
- Finset.casesOnstatement and proof · cited by 17
- Finset.card_eq_oneproof · cited by 16
- Multiset.Nodup.dedupstatement · cited by 15
- Finset.mem_powersetCardproof · cited by 14
- Polynomial.nodup_rootsstatement · cited by 10
- Multiset.nodup_consstatement · cited by 10
- Multiset.nodup_of_lestatement · cited by 10
- Multiset.dedup_eq_selfstatement and proof · cited by 9