Theorems · Theorem · combinatorics

Multiset.map_erase_of_mem

∀ {α : Type u_1} {β : Type v} [inst : DecidableEq α] [inst_1 : DecidableEq β] (f : α → β) (s : Multiset α) {x : α},
  x ∈ s → Multiset.map f (s.erase x) = (Multiset.map f s).erase (f x)

Defined in

Mathlib.Data.Multiset.MapFold

Cited by

2 results in Mathlib

Foundations

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

Assumes

DecidableEqDecidableEq