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. unfold cell_from_invertible_2cell. apply subtypePath. - intro. apply isPredicate_is_invertible_2cell. - apply p. Defined.
Require Import UniMath.Foundations.All. Require Import UniMath.MoreFoundations.All. Require Import UniMath.CategoryTheory.Core.Categories. Require Import UniMath.CategoryTheory.Core.Isos. Require Import UniMath.CategoryTheory.Core.Functors. Require Import UniMath.CategoryTheory.Core.NaturalTransformations. Require Import UniMath.CategoryTheory.PrecategoryBinProduct.