proposition: Lemma idtoiso_2_1_strict_cat {c d : bicat_of_strict_cats} {f g : functor (pr1 c) (pr1 d)} (p : pr1 f = pr1 g) (x : pr1 c) : pr11 (@idtoiso_2_1 bicat_of_strict_cats _ _ f g (functor_eq _ _ (isaset_mor d) f g p)) x = idtoiso (maponpaths (λ q, pr1 q x) p).
proof: Proof. induction f as [f Hf]. induction g as [g Hg]. simpl in *. induction p. apply idtoiso_2_1_strict_cat_help. 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