fact: Definition disp_psfunctor_rwhisker_law : UU := ∏ (a b c : B₁) (f₁ f₂ : B₁ ⟦ a, b ⟧) (g : B₁ ⟦ b, c ⟧) (η : f₁ ==> f₂) (aa : D₁ a) (bb : D₁ b) (cc : D₁ c) (ff₁ : aa -->[f₁] bb) (ff₂ : aa -->[f₂] bb) (gg : bb -->[g] cc) (ηη : ff₁ ==>[ η] ff₂), disp_psfunctor_comp FFdata _ _ •• disp_psfunctor_cell FFdata (ηη ▹▹ gg) = transportb (λ p, _ ==>[p] _) (psfunctor_rwhisker F g η) ((disp_psfunctor_cell FFdata ηη ▹▹ _) •• disp_psfunctor_comp FFdata _ _).
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Examples.Initial UniMath.Bicategories.Core.Examples.Final UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.Core.Univalence UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.DisplayedBicats.DispInvertibles UniMath.Bicategories.DisplayedBicats.DispAdjunctions UniMath.Bicategories.DisplayedBicats.DispUnivalence UniMath.Bicategories.DisplayedBicats.CleavingOfBicat UniMath.Bicategories.DisplayedBicats.FiberCategory UniMath.Bicategories.PseudoFunctors.Display.PseudoFunctorBicat UniMath.Bicategories.PseudoFunctors.PseudoFunctor UniMath.Bicategories.PseudoFunctors.Examples.Identity UniMath.Bicategories.PseudoFunctors.Examples.Composition