Theorems · Theorem · combinatorics

Multiset.filter_join

∀ {α : Type u_1} (S : Multiset (Multiset α)) (p : α → Prop) [inst : DecidablePred p],
  Multiset.filter p S.join = (Multiset.map (Multiset.filter p) S).join

Defined in

Mathlib.Data.Multiset.Bind

Cited by

1 results in Mathlib

Foundations

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

Assumes

DecidablePred