Theorems · Theorem · combinatorics

Multiset.foldr_cons

∀ {α : Type u_1} {β : Type v} (f : α → β → β) [inst : LeftCommutative f] (b : β) (a : α) (s : Multiset α),
  Multiset.foldr f b (a ::ₘ s) = f a (Multiset.foldr f b s)

Defined in

Mathlib.Data.Multiset.MapFold

Cited by

4 results in Mathlib

Foundations

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

Assumes

LeftCommutative