Theorems · Theorem · combinatorics
Multiset.count_filter_of_pos
∀ {α : Type u_1} [inst : DecidableEq α] {p : α → Prop} [inst_1 : DecidablePred p] {a : α} {s : Multiset α},
p a → Multiset.count a (Multiset.filter p s) = Multiset.count a s- Defined in
- Mathlib.Data.Multiset.Filter
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext, Quot.sound
- Assumes
- DecidableEqDecidablePred
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 · cited by 302
- Multiset.filterstatement · cited by 102
- Multiset.coe_countproof · cited by 23
Cited by5
Results whose statement or proof uses this declaration.
- Multiset.count_filterproof · cited by 3
- Multiset.count_map_eq_countproof · cited by 1
- PMF.toOuterMeasure_ofMultiset_applyproof · cited by 1
- Multiset.sub_filter_eq_filter_notproof · cited by 0
- Nat.Partition.count_ofSums_of_ne_zeroproof · cited by 0