Theorems · Theorem · combinatorics

Multiset.erase_attach_map

∀ {α : Type u_1} {β : Type v} [inst : DecidableEq α] (s : Multiset α) (f : α → β) (x : { x // x ∈ s }),
  Multiset.map (fun j => f ↑j) (s.attach.erase x) = Multiset.map f (s.erase ↑x)

Defined in

Mathlib.Data.Multiset.MapFold

Cited by

3 results in Mathlib

Foundations

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

Assumes

DecidableEq