Theorems · Theorem · combinatorics
Multiset.rel_bind
∀ {α : Type u_1} {β : Type v} {γ : Type u_2} {δ : Type u_3} {r : α → β → Prop} {p : γ → δ → Prop} {s : Multiset α}
{t : Multiset β} {f : α → Multiset γ} {g : β → Multiset δ},
Relator.LiftFun r (Multiset.Rel p) f g → Multiset.Rel r s t → Multiset.Rel p (s.bind f) (t.bind g)- Defined in
- Mathlib.Data.Multiset.Bind
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetstatement and proof · cited by 2,627
- Multiset.bindstatement · cited by 59
- Multiset.Relstatement and proof · cited by 47
- Relator.LiftFunstatement and proof · cited by 47
- Multiset.rel_mapproof · cited by 5
- Multiset.rel_joinproof · cited by 1
- Multiset.Rel.monoproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.