proposition: Lemma prewhisker_LRB_runitor {x y : B} (f : B⟦x,y⟧) : pr1 (LRB_runitor (η_{x,y} f)) = LRB_lwhisker (η_{x,y} f) (id₁ (η (hom y y) (id₁ y))) · pr1 (LRB_composition_comm x y y) (make_catbinprod (C := hom x y) (D := hom y y) f (id₁ y)) · # (η_{x,y}) (runitor f).
proof: Proof. refine (toforallpaths _ _ _ (base_paths _ _ (LRB_runitor_comm x y)) f @ _). etrans. 2: { do 2 apply maponpaths_2. apply (! functor_id (LRB_composition_curry1 x y y (η_{x,y} f)) _). } rewrite id_left. unfold LRB_runitor_nat_z_iso_pre. cbn. rewrite ! id_left. etrans. { apply maponpaths_2. etrans. { apply maponpaths, binprod_id. } apply functor_id. } now rewrite id_left, id_right. 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