proposition: Lemma idtoiso_2_1_strict_cat_help {c d : bicat_of_strict_cats} {f : functor_data (pr1 c) (pr1 d)} {Hf Hf' : is_functor f} (p : Hf = Hf') (x : pr1 c) : pr11 (@idtoiso_2_1 bicat_of_strict_cats _ _ _ _ (maponpaths (λ z, f ,, z) p)) x = id₁ (f x).
proof: Proof. induction p. apply idpath. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Setcategories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.catiso UniMath.CategoryTheory.CategoryEquality UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.whiskering UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Core.EquivToAdjequiv UniMath.Bicategories.Core.AdjointUnique UniMath.Bicategories.Core.Strictness UniMath.Bicategories.Core.Univalence