proposition: Lemma Monad_Mor_eq {C : category} (T T' : Monad C) (α β : Monad_Mor T T') (e : ∏ a : C, α a = β a) : α = β.
proof: Proof. use subtypePath. - intro. apply isaprop_disp_Monad_Mor_laws; apply homset_property. - now apply (nat_trans_eq_alt). 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