proposition: Lemma faithful_reflects_morphism_equality {C D : precategory} (F : functor C D) (FF : faithful F) {a b : ob C} (f g : C ⟦a, b⟧) : # F f = # F g → f = g.
proof: Proof. intros feq. apply (Injectivity (# F)). - apply isweqonpathsincl, FF. - exact feq. 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