Theorems · Theorem · combinatorics
Multiset.count_add
∀ {α : Type u_1} [inst : DecidableEq α] (a : α) (s t : Multiset α),
Multiset.count a (s + t) = Multiset.count a s + Multiset.count a t- Defined in
- Mathlib.Data.Multiset.AddSub
- Cited by
- 23 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses propext, 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 · cited by 2,627
- Multiset.countstatement · cited by 302
- Multiset.countP_addproof · cited by 2
Cited by23
Results whose statement or proof uses this declaration.
- Polynomial.roots_mulproof · cited by 12
- Multiset.count_nsmulproof · cited by 10
- Multiset.count_interproof · cited by 9
- Associates.count_mulproof · cited by 7
- Multiset.count_unionproof · cited by 6
- Multiset.add_eq_union_iff_disjointproof · cited by 6
- Multiset.count_sumproof · cited by 3
- Multiset.add_sub_cancel_rightproof · cited by 2
- Sym.count_coe_fill_of_neproof · cited by 2
- Sym.count_coe_fill_self_of_notMemproof · cited by 2
- Ideal.ramificationIdx'_algebra_towerproof · cited by 2
- Multiset.sub_add_cancelproof · cited by 2