Theorems · Definition · combinatorics
Multiset.bind
{α : Type u_1} → {β : Type v} → Multiset α → (α → Multiset β) → Multiset βs.bind f is the monad bind operation, defined as (s.map f).join. It is the union of f a as
a ranges over s.
- Defined in
- Mathlib.Data.Multiset.Bind
- Cited by
- 59 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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.mapproof · cited by 876
- Multiset.joinproof · cited by 21
Cited by67
Results whose statement or proof uses this declaration.
- Finset.biUnionproof · cited by 217
- Finset.disjiUnionproof · cited by 37
- Multiset.bind_congrstatement · cited by 15
- Multiset.cons_bindstatement · cited by 13
- Finset.sum_disjiUnionproof · cited by 10
- Multiset.sigmaproof · cited by 9
- Multiset.piproof · cited by 9
- Multiset.Sectionsproof · cited by 7
- Multiset.card_bindstatement · cited by 6
- Multiset.map_bindstatement · cited by 6
- Finset.prod_disjiUnionproof · cited by 6
- Multiset.coe_bindstatement and proof · cited by 5