Theorems · Theorem · group theory

Multiset.map_noncommProd

∀ {F : Type u_1} {α : Type u_3} {β : Type u_4} [inst : Monoid α] [inst_1 : Monoid β] [inst_2 : FunLike F α β]
  [inst_3 : MonoidHomClass F α β] (s : Multiset α) (comm : {x | x ∈ s}.Pairwise Commute) (f : F),
  f (s.noncommProd comm) = (Multiset.map (⇑f) s).noncommProd ⋯

Defined in

Mathlib.Data.Finset.NoncommProd

Cited by

1 results in Mathlib

Foundations

Depth 24 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

MonoidMonoidFunLikeMonoidHomClass