Theorems · Theorem · combinatorics
Multiset.filter_map
∀ {α : Type u_1} {β : Type v} (p : α → Prop) [inst : DecidablePred p] (f : β → α) (s : Multiset β),
Multiset.filter p (Multiset.map f s) = Multiset.map f (Multiset.filter (p ∘ f) s)- Defined in
- Mathlib.Data.Multiset.Filter
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Quot.sound
- Assumes
- DecidablePred
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.mapstatement · cited by 876
- Multiset.ofListproof · cited by 290
- Multiset.filterstatement · cited by 102
Cited by4
Results whose statement or proof uses this declaration.
- Finset.filter_mapproof · cited by 9
- Multiset.map_filter'proof · cited by 1
- Multiset.map_count_True_eq_filter_cardproof · cited by 1
- Equiv.Perm.CycleType.count_defproof · cited by 0