Theorems · Definition · order theory
Multiset.countPAddMonoidHom
{α : Type u_1} → (p : α → Prop) → [DecidablePred p] → Multiset α →+ ℕcountP p, the number of elements of a multiset satisfying p, promoted to an
AddMonoidHom.
- Defined in
- Mathlib.Algebra.Order.Group.Multiset
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AddMonoidHomstatement · cited by 3,230
- Multisetstatement · cited by 2,627
- Multiset.countPproof · cited by 28
- Multiset.countP_addproof · cited by 2
- Multiset.countP_zeroproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- Multiset.countAddMonoidHomproof · cited by 3
- Multiset.coe_countPAddMonoidHomstatement · cited by 0