Theorems · Theorem · combinatorics
Multiset.filterMap_eq_bind
∀ {α : Type u_1} {β : Type v} (m : Multiset α) (f : α → Option β),
Multiset.filterMap f m = m.bind fun a => (Option.map singleton (f a)).getD 0- Defined in
- Mathlib.Data.Multiset.Bind
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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.bindstatement and proof · cited by 59
- Multiset.inductionproof · cited by 31
- Multiset.filterMapstatement and proof · cited by 25
- Multiset.cons_bindproof · cited by 13
- Multiset.filterMap_consproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Multiset.bind_filterMapproof · cited by 0