Lemma disp_rwhisker_transport_left {a b c : C} {f1 f2 : C⟦a,b⟧} {g : C⟦b,c⟧} {x x' : f1 ==> f2} (p : x = x') {aa : D a} {bb : D b} {cc : D c} {ff1 : aa -->[f1] bb} {ff2 : aa -->[f2] bb} (xx : ff1 ==>[x] ff2) (gg : bb -->[g] cc) : (transportf (λ x, _ ==>[x] _) p xx) ▹▹ gg = transportf (λ x, _ ==>[x ▹ g] _) p (xx ▹▹ gg). Proof. induction p. apply idpath. Defined.
Require Import UniMath.Foundations.All. Require Import UniMath.MoreFoundations.All. Require Import UniMath.CategoryTheory.Core.Categories. Require Import UniMath.CategoryTheory.DisplayedCats.Core. Require Import UniMath.CategoryTheory.DisplayedCats.Total. Require Import UniMath.Bicategories.Core.Bicat. Import Bicat.Notations. Require Import UniMath.Bicategories.Core.Invertible_2cells. Require Import UniMath.Bicategories.Core.BicategoryLaws. Require Import UniMath.Bicategories.Core.Unitors. Require Import UniMath.Bicategories.Morphisms.Adjunctions. Require Import UniMath.Bicategories.Core.Univalence.