proposition: Lemma unkleislify_laws {C : category} (T : KleisliMonad C) : disp_Monad_laws (unkleislify_data T).
proof: Proof. split; simpl; intros; unfold μ. + split; intros. * apply (bind_η T). * rewrite (bind_map T). rewrite id_right. apply (η_bind T). + rewrite (bind_map T). rewrite id_right. rewrite (bind_bind T). now rewrite id_left. Defined.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.Monads.Monads UniMath.CategoryTheory.Monads.KTriples UniMath.CategoryTheory.catiso UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.Equivalences.FullyFaithful