Theorems · Definition · combinatorics
Multiset.countP
{α : Type u_1} → (p : α → Prop) → [DecidablePred p] → Multiset α → ℕcountP p s counts the number of elements of s (with multiplicity) that
satisfy p.
- Defined in
- Mathlib.Data.Multiset.Count
- Cited by
- 28 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
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
Cited by30
Results whose statement or proof uses this declaration.
- Multiset.countproof · cited by 302
- Multiset.countP_congrstatement · cited by 4
- Multiset.countP_eq_card_filterstatement · cited by 4
- Multiset.countP_consstatement · cited by 3
- Multiset.countP_cons_of_posstatement · cited by 3
- Multiset.countP_addstatement · cited by 2
- Multiset.countP_le_of_lestatement · cited by 2
- Multiset.countP_mapstatement and proof · cited by 2
- Multiset.countP_posstatement · cited by 2
- Multiset.countP.congr_simpstatement and proof · cited by 2
- Multiset.countPAddMonoidHomproof · cited by 1
- Multiset.countP_attachstatement and proof · cited by 1