Theorems · Theorem · combinatorics
Multiset.fold_bind
∀ {α : Type u_1} (op : α → α → α) [hc : Std.Commutative op] [ha : Std.Associative op] {ι : Type u_4} (s : Multiset ι)
(t : ι → Multiset α) (b : ι → α) (b₀ : α),
Multiset.fold op (Multiset.fold op b₀ (Multiset.map b s)) (s.bind t) =
Multiset.fold op b₀ (Multiset.map (fun i => Multiset.fold op (b i) (t i)) s)- 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.
Cites13
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.consproof · cited by 313
- Multiset.induction_onproof · cited by 109
- Multiset.map_consproof · cited by 93
- Multiset.bindstatement and proof · cited by 59
- Multiset.foldstatement and proof · cited by 38
- Multiset.fold_cons_leftproof · cited by 14
- Multiset.cons_bindproof · cited by 13
- Multiset.fold_addproof · cited by 9
- Multiset.map_zeroproof · cited by 8
- Multiset.fold_zeroproof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- Finset.fold_disjiUnionproof · cited by 2