proposition: Lemma yoneda_fully_faithful (C : category) : fully_faithful (yoneda C).
proof: Proof. intros a b; simpl. apply (isweq_iso _ (yoneda_map_1 C a (pr1 (yoneda C) b))). - intro; simpl in *. apply id_left. - intro gamma. simpl in *. apply nat_trans_eq. apply (has_homsets_HSET). intro x. simpl in *. apply funextsec; intro f. unfold yoneda_map_1. unfold yoneda_morphisms_data. assert (T:= toforallpaths _ _ _ (nat_trans_ax gamma a x f) (identity _ )). cbn in T. eapply pathscomp0; [apply (!T) |]. apply maponpaths. apply id_right. Defined.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.opp_precat UniMath.CategoryTheory.Categories.HSET.Core UniMath.CategoryTheory.Categories.HSET.MonoEpiIso UniMath.CategoryTheory.whiskering