fact: Definition pb_2cell_on_rwhisker {a₁ a₂ a₃ b₁ b₂ : B} (f : b₁ --> b₂) {g₁ : a₁ --> b₂} {g₂ : a₂ --> b₂} {g₃ : a₃ --> b₂} {h₁ h₂ : a₁ --> a₂} {h₃ : a₂ --> a₃} {α₁ : invertible_2cell g₁ (h₁ · g₂)} {α₂ : invertible_2cell g₁ (h₂ · g₂)} (β : invertible_2cell g₂ (h₃ · g₃)) {γ : h₁ ==> h₂} (p : α₁ • (γ ▹ g₂) = α₂) (q : comp_of_invertible_2cell α₁ (comp_of_invertible_2cell (lwhisker_of_invertible_2cell h₁ β) (lassociator_invertible_2cell h₁ h₃ g₃)) • ((γ ▹ h₃) ▹ g₃) = comp_of_invertible_2cell α₂ (comp_of_invertible_2cell (lwhisker_of_invertible_2cell h₂ β) (lassociator_invertible_2cell h₂ h₃ g₃))) : pb_1cell_on_comp f α₁ β • f /≃₂ q = (f /≃₂ p ▹ f /≃₁ β) • pb_1cell_on_comp f α₂ β.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Unitors UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Limits.Pullbacks