Theorems · Theorem · group theory

AddEquiv.map_finsum_mem

∀ {α : Type u_1} {M : Type u_5} {N : Type u_6} [inst : AddCommMonoid M] [inst_1 : AddCommMonoid N] (g : M ≃+ N)
  (f : α → M) {s : Set α}, s.Finite → g (∑ᶠ (i : α) (_ : i ∈ s), f i) = ∑ᶠ (i : α) (_ : i ∈ s), g (f i)

Defined in

Mathlib.Algebra.BigOperators.Finprod

Cited by

1 results in Mathlib

Foundations

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

Assumes

AddCommMonoidAddCommMonoid