proposition: Lemma cell_from_invertible_2cell_eq {C : bicat} {a b : C} {f g : C⟦a,b⟧} {x y : invertible_2cell f g} (p : cell_from_invertible_2cell x = cell_from_invertible_2cell y) : x = y.
proof: Proof. unfold cell_from_invertible_2cell. apply subtypePath. - intro. apply isPredicate_is_invertible_2cell. - apply p. Defined.
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