proposition: Lemma τ_lmodule_laws : LModule_Mor_laws T_mon (T:=HT_mod) (T' := T_mod) (τ T).
proof: Proof. intro a. apply pathsinv0. exact (nat_trans_eq_pointwise (fbracket_τ T (Z:= p T)(identity _ )) a). Qed.
imports: UniMath.Foundations.PartD UniMath.MoreFoundations.Propositions UniMath.CategoryTheory.PointedFunctors UniMath.CategoryTheory.PointedFunctorsComposition UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.FunctorCategory UniMath.SubstitutionSystems.Signatures UniMath.SubstitutionSystems.Notation UniMath.CategoryTheory.Monads.LModules UniMath.SubstitutionSystems.SimplifiedHSS.SubstitutionSystems UniMath.CategoryTheory.Monads.Monads UniMath.CategoryTheory.whiskering UniMath.SubstitutionSystems.SimplifiedHSS.MonadsFromSubstitutionSystems UniMath.CategoryTheory.HorizontalComposition UniMath.CategoryTheory.FunctorAlgebras UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Chains.All UniMath.CategoryTheory.Presheaf UniMath.SubstitutionSystems.SimplifiedHSS.LiftingInitial_alt UniMath.SubstitutionSystems.GenMendlerIteration_alt UniMath.CategoryTheory.Limits.Initial