fact: Definition pb_2cell_on_lwhisker {a₁ a₂ a₃ b₁ b₂ : B} (f : b₁ --> b₂) {g₁ : a₁ --> b₂} {g₂ : a₂ --> b₂} {g₃ : a₃ --> b₂} {h₁ : a₁ --> a₂} {h₂ 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 /≃₁ α ◃ f /≃₂ p) • 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