Theorems · Theorem · combinatorics

List.Vector.prod_set

∀ {α : Type u_1} {n : ℕ} [inst : Monoid α] (v : List.Vector α n) (i : Fin n) (a : α),
  (v.set i a).toList.prod = (List.Vector.take (↑i) v).toList.prod * a * (List.Vector.drop (↑i + 1) v).toList.prod

Defined in

Mathlib.Data.Vector.Basic

Cited by

0 results in Mathlib

Foundations

Depth 25 from the axioms · uses propext

Assumes

Monoid