Theorems · Theorem · combinatorics

Multiset.filter_bind

∀ {α : Type u_1} {β : Type v} (m : Multiset α) (f : α → Multiset β) (p : β → Prop) [inst : DecidablePred p],
  Multiset.filter p (m.bind f) = m.bind fun a => Multiset.filter p (f a)

Defined in

Mathlib.Data.Multiset.Bind

Cited by

0 results in Mathlib

Foundations

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

Assumes

DecidablePred