Theorems · Theorem · combinatorics

Finset.fold_op_distrib

∀ {α : Type u_1} {β : Type u_2} {op : β → β → β} [hc : Std.Commutative op] [ha : Std.Associative op] {s : Finset α}
  {f g : α → β} {b₁ b₂ : β},
  Finset.fold op (op b₁ b₂) (fun x => op (f x) (g x)) s = op (Finset.fold op b₁ f s) (Finset.fold op b₂ g s)

Defined in

Mathlib.Data.Finset.Fold

Cited by

2 results in Mathlib

Foundations

Depth 16 from the axioms · uses propext, Quot.sound

Assumes

Std.CommutativeStd.Associative