Theorem yonffth 18336

Description: The Yoneda Lemma. The Yoneda embedding, the curried Hom functor, is full and faithful, and hence is a representation of the category 𝐶 as a full subcategory of the category 𝑄 of presheaves on 𝐶. (Contributed by Mario Carneiro, 29-Jan-2017.)

Hypotheses

Ref	Expression
yonffth.y	⊢ 𝑌 = (Yon‘𝐶)
yonffth.o	⊢ 𝑂 = (oppCat‘𝐶)
yonffth.s	⊢ 𝑆 = (SetCat‘𝑈)
yonffth.q	⊢ 𝑄 = (𝑂 FuncCat 𝑆)
yonffth.c	⊢ (𝜑 → 𝐶 ∈ Cat)
yonffth.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
yonffth.h	⊢ (𝜑 → ran (Homf ‘𝐶) ⊆ 𝑈)

Assertion

Ref	Expression
yonffth	⊢ (𝜑 → 𝑌 ∈ ((𝐶 Full 𝑄) ∩ (𝐶 Faith 𝑄)))

Proof of Theorem yonffth

Dummy variables 𝑓 𝑎 𝑔 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		yonffth.y	. 2 ⊢ 𝑌 = (Yon‘𝐶)
2		eqid 2769	. 2 ⊢ (Base‘𝐶) = (Base‘𝐶)
3		eqid 2769	. 2 ⊢ (Id‘𝐶) = (Id‘𝐶)
4		yonffth.o	. 2 ⊢ 𝑂 = (oppCat‘𝐶)
5		yonffth.s	. 2 ⊢ 𝑆 = (SetCat‘𝑈)
6		eqid 2769	. 2 ⊢ (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)) = (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈))
7		yonffth.q	. 2 ⊢ 𝑄 = (𝑂 FuncCat 𝑆)
8		eqid 2769	. 2 ⊢ (HomF‘𝑄) = (HomF‘𝑄)
9		eqid 2769	. 2 ⊢ ((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈))) = ((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)))
10		eqid 2769	. 2 ⊢ (𝑂 evalF 𝑆) = (𝑂 evalF 𝑆)
11		eqid 2769	. 2 ⊢ ((HomF‘𝑄) ∘func ((⟨(1st ‘𝑌), tpos (2nd ‘𝑌)⟩ ∘func (𝑄 2ndF 𝑂)) ⟨,⟩F (𝑄 1stF 𝑂))) = ((HomF‘𝑄) ∘func ((⟨(1st ‘𝑌), tpos (2nd ‘𝑌)⟩ ∘func (𝑄 2ndF 𝑂)) ⟨,⟩F (𝑄 1stF 𝑂)))
12		yonffth.c	. 2 ⊢ (𝜑 → 𝐶 ∈ Cat)
13		fvex 6892	. . . 4 ⊢ (Homf ‘𝑄) ∈ V
14	13	rnex 7903	. . 3 ⊢ ran (Homf ‘𝑄) ∈ V
15		yonffth.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
16		unexg 7738	. . 3 ⊢ ((ran (Homf ‘𝑄) ∈ V ∧ 𝑈 ∈ 𝑉) → (ran (Homf ‘𝑄) ∪ 𝑈) ∈ V)
17	14, 15, 16	sylancr 598	. 2 ⊢ (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ∈ V)
18		yonffth.h	. 2 ⊢ (𝜑 → ran (Homf ‘𝐶) ⊆ 𝑈)
19		ssidd 3968	. 2 ⊢ (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ (ran (Homf ‘𝑄) ∪ 𝑈))
20		eqid 2769	. 2 ⊢ (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘((Id‘𝐶)‘𝑥)))) = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘((Id‘𝐶)‘𝑥))))
21		eqid 2769	. 2 ⊢ (Inv‘((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)))) = (Inv‘((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈))))
22		eqid 2769	. 2 ⊢ (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑢 ∈ ((1st ‘𝑓)‘𝑥) ↦ (𝑦 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd ‘𝑓)𝑦)‘𝑔)‘𝑢))))) = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑢 ∈ ((1st ‘𝑓)‘𝑥) ↦ (𝑦 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd ‘𝑓)𝑦)‘𝑔)‘𝑢)))))
23	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 17, 18, 19, 20, 21, 22	yonffthlem 18334	1 ⊢ (𝜑 → 𝑌 ∈ ((𝐶 Full 𝑄) ∩ (𝐶 Faith 𝑄)))

Syntax hints:   → wi 4   = wceq 1567   ∈ wcel 2149  Vcvv 3463   ∪ cun 3911   ∩ cin 3912   ⊆ wss 3913  ⟨cop 4597   ↦ cmpt 5193  ran crn 5660  ‘cfv 6534  (class class class)co 7408   ∈ cmpo 7410  1^st c1st 7980  2^nd c2nd 7981  tpos ctpos 8217  Basecbs 17265  Hom chom 17317  Catccat 17716  Idccid 17717  Hom_f chomf 17718  oppCatcoppc 17763  Invcinv 17798   Func cfunc 17907   ∘_func ccofu 17909   Full cful 17957   Faith cfth 17958   Nat cnat 17997   FuncCat cfuc 17998  SetCatcsetc 18128   ×_c cxpc 18220   1^st_F c1stf 18221   2^nd_F c2ndf 18222   ⟨,⟩_F cprf 18223   eval_F cevlf 18261  Hom_Fchof 18300  Yoncyon 18301

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-cnex 11152  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-mulcom 11160  ax-addass 11161  ax-mulass 11162  ax-distr 11163  ax-i2m1 11164  ax-1ne0 11165  ax-1rid 11166  ax-rnegex 11167  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170  ax-pre-lttrn 11171  ax-pre-ltadd 11172  ax-pre-mulgt0 11173

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6300  df-ord 6361  df-on 6362  df-lim 6363  df-suc 6364  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-tpos 8218  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-map 8822  df-pm 8823  df-ixp 8892  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-sub 11439  df-neg 11440  df-nn 12230  df-2 12299  df-3 12300  df-4 12301  df-5 12302  df-6 12303  df-7 12304  df-8 12305  df-9 12306  df-n0 12501  df-z 12588  df-dec 12708  df-uz 12859  df-fz 13532  df-struct 17203  df-sets 17220  df-slot 17238  df-ndx 17250  df-base 17266  df-ress 17287  df-hom 17330  df-cco 17331  df-cat 17720  df-cid 17721  df-homf 17722  df-comf 17723  df-oppc 17764  df-sect 17800  df-inv 17801  df-iso 17802  df-ssc 17863  df-resc 17864  df-subc 17865  df-func 17911  df-cofu 17913  df-full 17959  df-fth 17960  df-nat 17999  df-fuc 18000  df-setc 18129  df-xpc 18224  df-1stf 18225  df-2ndf 18226  df-prf 18227  df-evlf 18265  df-curf 18266  df-hof 18302  df-yon 18303

This theorem is referenced by:  yoniso  18337