Theorems · Theorem · combinatorics
Multiset.cons_erase
∀ {α : Type u_1} [inst : DecidableEq α] {s : Multiset α} {a : α}, a ∈ s → a ::ₘ s.erase a = s- Defined in
- Mathlib.Data.Multiset.AddSub
- Cited by
- 25 results in Mathlib
- Foundations
- Depth 20 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.
Cites3
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.erasestatement · cited by 93
Cited by25
Results whose statement or proof uses this declaration.
- Multiset.inter_le_rightproof · cited by 6
- Multiset.gcd_dedupproof · cited by 4
- Multiset.fold_dedup_idemproof · cited by 4
- Equiv.Perm.toCycle_eq_toListproof · cited by 4
- card_support_eq_three_iffproof · cited by 3
- Polynomial.derivative_prodproof · cited by 3
- prime_factors_uniqueproof · cited by 3
- Multiset.mem_interproof · cited by 3
- Multiset.lcm_dedupproof · cited by 3
- Multiset.sub_add_interproof · cited by 3
- Multiset.erase_ltproof · cited by 2
- prime_factors_irreducibleproof · cited by 2