Theorems · Theorem · combinatorics
Multiset.dedup_eq_self
∀ {α : Type u_1} [inst : DecidableEq α] {s : Multiset α}, s.dedup = s ↔ s.Nodup- Defined in
- Mathlib.Data.Multiset.Dedup
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 72 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.
Cites7
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
- Multiset.Nodupstatement and proof · cited by 148
- Multiset.dedupstatement and proof · cited by 59
- Quot.induction_onproof · cited by 36
- Multiset.nodup_dedupproof · cited by 3
- List.Nodup.dedupproof · cited by 2
Cited by9
Results whose statement or proof uses this declaration.
- Multiset.Nodup.dedupproof · cited by 15
- Multiset.toFinset_card_of_nodupproof · cited by 6
- FiniteField.roots_X_pow_card_sub_Xproof · cited by 2
- Finset.injOn_of_card_image_eqproof · cited by 2
- Multiset.dedup_card_eq_card_iff_nodupproof · cited by 1
- Algebra.norm_eq_prod_embeddings_genproof · cited by 1
- trace_eq_sum_embeddings_genproof · cited by 1
- UniqueFactorizationMonoid.primeFactors_val_eq_normalizedFactorsproof · cited by 1
- ConjRootClass.minpoly.map_eq_prodproof · cited by 0