proposition: Lemma mlift_id {R : RelMonad_data J} {M : RelModule_data R} (X : RelModule_laws M) (c : C) : mlift M (identity c) = identity (M c).
proof: Proof. transitivity (mbind M (r_eta R c)). 2: apply (mbind_r_eta X). unfold mlift. cbn. apply maponpaths. etrans. 2: apply id_left. apply maponpaths_2. apply functor_id. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Monads.RelativeMonads