proposition: Lemma Monad_law5 {C : category} {T : Monad C} {a b: C} (f: a --> b) : # T (# T f) · (Monads.μ T b) = (Monads.μ T a) · (# T f).
proof: Proof. apply (nat_trans_ax (Monads.μ T) _ _ f). 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