proposition: Lemma LModule_composition_laws {C : category} {T T' T'' : LModule C} (α : LModule_Mor T T') (α' : LModule_Mor T' T'') : LModule_Mor_laws (nat_trans_comp _ _ _ α α').
proof: Proof. red; intros; simpl. unfold nat_trans_from_module_mor. rewrite assoc. etrans; revgoals. apply cancel_postcomposition. apply (LModule_Mor_σ α a). rewrite <- !assoc. apply cancel_precomposition. apply (LModule_Mor_σ α' a). Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.Monads.Monads