Theorems · Theorem · combinatorics
Multiset.dedup_cons_of_mem
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Multiset α}, a ∈ s → (a ::ₘ s).dedup = s.dedup- Defined in
- Mathlib.Data.Multiset.Dedup
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 71 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.
Cites6
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.consstatement · cited by 313
- Multiset.ofListproof · cited by 290
- Multiset.dedupstatement · cited by 59
- Quot.induction_onproof · cited by 36
- List.dedup_cons_of_memproof · cited by 9
Cited by4
Results whose statement or proof uses this declaration.
- Multiset.fold_dedup_idemproof · cited by 4
- Multiset.gcd_dedupproof · cited by 4
- Multiset.lcm_dedupproof · cited by 3
- Multiset.dedup_consproof · cited by 2