Theorems · Theorem · combinatorics
Multiset.prod_map_product_eq_prod_prod
∀ {α : Type u_1} {β : Type v} {M : Type u_4} [inst : CommMonoid M] (s : Multiset α) (t : Multiset β) (f : α × β → M),
(Multiset.map f (s ×ˢ t)).prod = (Multiset.map (fun i => (Multiset.map (fun j => f (i, j)) t).prod) s).prod- Defined in
- Mathlib.Data.Multiset.Bind
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommMonoid
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
- CommMonoidstatement and proof · cited by 2,264
- SProd.sprodstatement and proof · cited by 1,750
- Multiset.mapstatement and proof · cited by 876
- Multiset.prodstatement and proof · cited by 528
- Multiset.map_congrproof · cited by 232
- Multiset.map_mapproof · cited by 151
- Multiset.map_consproof · cited by 93
- Multiset.prod_consproof · cited by 68
- Multiset.inductionproof · cited by 31
- Multiset.map_addproof · cited by 26
- Multiset.prod_addproof · cited by 18
Cited by1
Results whose statement or proof uses this declaration.
- Polynomial.map_sub_sprod_roots_eq_prod_map_evalproof · cited by 3