proposition: Lemma mlift_mbind {c d e : C} (f : c --> d) (g : J d --> R e) : mlift M f · mbind M g = mbind M (#J f · g).
proof: Proof. unfold mlift. etrans. { apply (mbind_mbind X). } apply maponpaths. etrans. { apply pathsinv0, assoc. } apply maponpaths. apply (r_eta_r_bind R). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Monads.RelativeMonads