proposition: Lemma is_functor_lifting_from_distr_law_data {C D: category} {F: functor C C} {G: functor D D} {H: functor C D} (lambda : DistrLaw G F H H): is_functor (lifting_from_distr_law_data lambda).
proof: Proof. split. - intro Aa. unfold lifting_from_distr_law_data. cbn. UniMath.MoreFoundations.Tactics.show_id_type. use total2_paths_f. 2: { apply homset_property. } cbn. apply functor_id. - intros Aa Bb Cc f g. unfold lifting_from_distr_law_data. cbn. UniMath.MoreFoundations.Tactics.show_id_type. use total2_paths_f. 2: { apply homset_property. } cbn. apply functor_comp. Qed.
imports: UniMath.Foundations.Sets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.FunctorAlgebras UniMath.CategoryTheory.UnitorsAndAssociatorsForEndofunctors UniMath.CategoryTheory.Limits.Initial UniMath.CategoryTheory.Adjunctions.Core