Theorems · Theorem · group theory

Finset.noncommSum_toFinset

∀ {α : Type u_3} {β : Type u_4} [inst : AddMonoid β] [inst_1 : DecidableEq α] (l : List α) (f : α → β)
  (comm : (↑l.toFinset).Pairwise (Function.onFun AddCommute f)),
  l.Nodup → l.toFinset.noncommSum f comm = (List.map f l).sum

Defined in

Mathlib.Data.Finset.NoncommProd

Cited by

0 results in Mathlib

Foundations

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

Assumes

AddMonoidDecidableEq