proposition: Lemma inv_cell_eq {C : bicat} {a b : C} {f g : C ⟦a, b⟧} (x y : f ==> g) (inv_x : is_invertible_2cell x) (inv_y : is_invertible_2cell y) (p : inv_x^-1 = inv_y^-1) : x = y.
proof: Proof. apply (vcomp_rcancel _ (is_invertible_2cell_inv inv_x)). rewrite vcomp_rinv, p. apply (!vcomp_rinv _). Qed.
imports: UniMath.Tactics.EnsureStructuredProofs UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.PrecategoryBinProduct