proposition: Lemma LRB_lassociator_lwhisker_on {a b c d e : B} (f0 : hom a b) (g0 : hom b c) (h0 : hom c d) (i0 : hom d e) : LRB_lwhisker (η (hom a b) f0) (LRB_associator (η (hom b c) g0) (η (hom c d) h0) (η (hom d e) i0)) = LRB_lassociator_lwhisker f0 g0 h0 i0 · #(η (hom _ _)) (f0 ◃ rassociator g0 h0 i0) · LRB_lassociator_lwhisker' f0 g0 h0 i0.
proof: Proof. etrans. { unfold LRB_lwhisker. apply maponpaths. exact (prewhisker_LRB_associator' g0 h0 i0). } unfold LRB_associator_pre_simpl_mor. simpl. unfold functor_fix_snd_arg_mor. unfold LRB_lassociator_lwhisker, LRB_lassociator_lwhisker'. simpl. etrans. { apply maponpaths, maponpaths_2. exact (! id_left (id₁ (η (hom a b) f0))). } etrans. { etrans. { apply maponpaths, binprod_comp. } apply (functor_comp (LRB_composition a b e)). } rewrite ! assoc'. apply maponpaths. etrans. { apply maponpaths, maponpaths_2. exact (! id_left (id₁ (η (hom a b) f0))). } etrans. { etrans. { apply maponpaths, binprod_comp. } apply (functor_comp (LRB_composition a b e)). } apply maponpaths. etrans. { apply maponpaths, maponpaths_2. exact (! id_left (id₁ (η (hom a b) f0))). } etrans. { etrans. { apply maponpaths, binprod_comp. } apply (functor_comp (LRB_composition a b e)). } rewrite ! assoc. etrans. { do 2 apply maponpaths. apply maponpaths_2. exact (! id_left (id₁ (η (hom a b) f0))). } etrans. { apply maponpaths. etrans. { apply maponpaths, binprod_comp. } apply (functor_comp (LRB_composition a b e)). } rewrite ! assoc. etrans. 2: { apply maponpaths_2. refine (pr21 (LRB_composition_comm a b e) _ _ (id₁ f0 #, (rassociator g0 h0 i0 : (hom _ _)⟦_,_⟧)) @ _). apply maponpaths. cbn. apply maponpaths. apply hcomp_identity_left. } cbn. etrans. { do 2 apply maponpaths_2. apply maponpaths. apply maponpaths_2. apply pathsinv0, (functor_id (η (hom _ _))). } rewrite ! assoc'. apply maponpaths. unfold LRB_associator_comp_r'. cbn. rewrite ! assoc. apply maponpaths_2. etrans. 2: { apply maponpaths_2. apply pathsinv0. apply (pr2 (pr2 (LRB_composition_comm a b e) (f0, g0 · (h0 · i0) : hom _ _))). } now rewrite id_left. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.Equivalences.CompositesAndInverses UniMath.CategoryTheory.PrecompEquivalence UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.RezkCompletion UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Examples.BicatOfUnivCats UniMath.Bicategories.Core.Univalence UniMath.Bicategories.Core.YonedaLemma UniMath.Bicategories.PseudoFunctors.Display.PseudoFunctorBicat UniMath.Bicategories.PseudoFunctors.PseudoFunctor UniMath.Bicategories.PseudoFunctors.Properties UniMath.Bicategories.PseudoFunctors.Examples.Composition