proposition: Lemma fully_faithful_inv_hom_is_inv {C D : precategory} {F : functor C D} (FF : fully_faithful F) {a b : ob C} (f : C⟦a, b⟧) : FF^-1 (# F f) = f.
proof: Proof. cbn. apply invmap_eq. reflexivity. Defined.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Univalence UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.TransportMorphisms UniMath.CategoryTheory.Core.Univalence