Theorems · Theorem · combinatorics
Multiset.dedup_cons
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Multiset α}, (a ::ₘ s).dedup = Multiset.ndinsert a s.dedup- Defined in
- Mathlib.Data.Multiset.FinsetOps
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 73 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.
Cites8
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 and proof · cited by 313
- Multiset.dedupstatement and proof · cited by 59
- Multiset.ndinsertstatement · cited by 24
- Multiset.ndinsert_of_notMemproof · cited by 8
- Multiset.ndinsert_of_memproof · cited by 5
- Multiset.dedup_cons_of_memproof · cited by 4
- Multiset.dedup_cons_of_notMemproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- Multiset.toFinset_consproof · cited by 2
- Finset.insert_val'proof · cited by 0