proposition: Lemma idtoiso_2_1_concat {C : bicat} {a b : C} {f₁ f₂ f₃ : a --> b} (p : f₁ = f₂) (q : f₂ = f₃) : idtoiso_2_1 _ _ (p @ q) = comp_of_invertible_2cell (idtoiso_2_1 _ _ p) (idtoiso_2_1 _ _ q).
proof: Proof. induction p ; induction q ; cbn. use subtypePath. { intro ; apply isaprop_is_invertible_2cell. } exact (!(id2_left _)). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Unitors UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Core.Univalence