Theorems · Theorem · combinatorics
Multiset.count_erase_self
∀ {α : Type u_1} [inst : DecidableEq α] (a : α) (s : Multiset α), Multiset.count a (s.erase a) = Multiset.count a s - 1- Defined in
- Mathlib.Data.Multiset.AddSub
- Cited by
- 1 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.
Cites4
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.countstatement and proof · cited by 302
- Multiset.erasestatement and proof · cited by 93
- Multiset.coe_countproof · cited by 23
Cited by1
Results whose statement or proof uses this declaration.
- Multiset.sub_singletonproof · cited by 0