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