proposition: Proposition transportf_hcomp_r {C : double_cat} {x₁ x₂ y₁ y₂ z₁ z₂ : C} {v₁ : x₁ -->v x₂} {v₂ v₂' : y₁ -->v y₂} {v₃ v₃' : z₁ -->v z₂} {h₁ : x₁ -->h y₁} {h₂ : y₁ -->h z₁} {k₁ : x₂ -->h y₂} {k₂ : y₂ -->h z₂} (p : v₂ = v₂') (q : v₃ = v₃') (s₁ : square v₁ v₂' h₁ k₁) (s₂ : square v₂ v₃ h₂ k₂) : s₁ ⋆h transportf_square p q s₂ = transportf_square (idpath _) q (transportf_square (idpath _) (!p) s₁ ⋆h s₂).
proof: Proof. induction p, q ; cbn. apply idpath. Qed.
imports: UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Prelude UniMath.CategoryTheory.TwoSidedDisplayedCats.TwoSidedDispCat UniMath.CategoryTheory.TwoSidedDisplayedCats.Univalence UniMath.Bicategories.Core.Bicat UniMath.Bicategories.DoubleCategories.Core.DoubleCats UniMath.Bicategories.DoubleCategories.Core.UnivalentDoubleCats