Theorems · Theorem · combinatorics
Multiset.bind_map
∀ {α : Type u_1} {β : Type v} {γ : Type u_2} (m : Multiset α) (n : β → Multiset γ) (f : α → β),
(Multiset.map f m).bind n = m.bind fun a => n (f a)- Defined in
- Mathlib.Data.Multiset.Bind
- Cited by
- 5 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.mapstatement and proof · cited by 876
- Multiset.induction_onproof · cited by 109
- Multiset.map_consproof · cited by 93
- Multiset.bindstatement and proof · cited by 59
- Multiset.cons_bindproof · cited by 13
Cited by5
Results whose statement or proof uses this declaration.
- Polynomial.roots_prodproof · cited by 4
- Polynomial.roots_multiset_prod_X_sub_Cproof · cited by 3
- Multiset.antidiagonal_addproof · cited by 0
- Multiset.sections_addproof · cited by 0
- Finset.map_disjiUnionproof · cited by 0