Theorem yonffth 18242

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 2731	. 2 ⊢ (Base‘𝐶) = (Base‘𝐶)
3		eqid 2731	. 2 ⊢ (Id‘𝐶) = (Id‘𝐶)
4		yonffth.o	. 2 ⊢ 𝑂 = (oppCat‘𝐶)
5		yonffth.s	. 2 ⊢ 𝑆 = (SetCat‘𝑈)
6		eqid 2731	. 2 ⊢ (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)) = (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈))
7		yonffth.q	. 2 ⊢ 𝑄 = (𝑂 FuncCat 𝑆)
8		eqid 2731	. 2 ⊢ (HomF‘𝑄) = (HomF‘𝑄)
9		eqid 2731	. 2 ⊢ ((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈))) = ((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)))
10		eqid 2731	. 2 ⊢ (𝑂 evalF 𝑆) = (𝑂 evalF 𝑆)
11		eqid 2731	. 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 6904	. . . 4 ⊢ (Homf ‘𝑄) ∈ V
14	13	rnex 7906	. . 3 ⊢ ran (Homf ‘𝑄) ∈ V
15		yonffth.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
16		unexg 7739	. . 3 ⊢ ((ran (Homf ‘𝑄) ∈ V ∧ 𝑈 ∈ 𝑉) → (ran (Homf ‘𝑄) ∪ 𝑈) ∈ V)
17	14, 15, 16	sylancr 586	. 2 ⊢ (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ∈ V)
18		yonffth.h	. 2 ⊢ (𝜑 → ran (Homf ‘𝐶) ⊆ 𝑈)
19		ssidd 4005	. 2 ⊢ (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ (ran (Homf ‘𝑄) ∪ 𝑈))
20		eqid 2731	. 2 ⊢ (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘((Id‘𝐶)‘𝑥)))) = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘((Id‘𝐶)‘𝑥))))
21		eqid 2731	. 2 ⊢ (Inv‘((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)))) = (Inv‘((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈))))
22		eqid 2731	. 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 18240	1 ⊢ (𝜑 → 𝑌 ∈ ((𝐶 Full 𝑄) ∩ (𝐶 Faith 𝑄)))

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2105  Vcvv 3473   ∪ cun 3946   ∩ cin 3947   ⊆ wss 3948  ⟨cop 4634   ↦ cmpt 5231  ran crn 5677  ‘cfv 6543  (class class class)co 7412   ∈ cmpo 7414  1^st c1st 7976  2^nd c2nd 7977  tpos ctpos 8213  Basecbs 17149  Hom chom 17213  Catccat 17613  Idccid 17614  Hom_f chomf 17615  oppCatcoppc 17660  Invcinv 17697   Func cfunc 17809   ∘_func ccofu 17811   Full cful 17858   Faith cfth 17859   Nat cnat 17897   FuncCat cfuc 17898  SetCatcsetc 18030   ×_c cxpc 18125   1^st_F c1stf 18126   2^nd_F c2ndf 18127   ⟨,⟩_F cprf 18128   eval_F cevlf 18167  Hom_Fchof 18206  Yoncyon 18207

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7728  ax-cnex 11169  ax-resscn 11170  ax-1cn 11171  ax-icn 11172  ax-addcl 11173  ax-addrcl 11174  ax-mulcl 11175  ax-mulrcl 11176  ax-mulcom 11177  ax-addass 11178  ax-mulass 11179  ax-distr 11180  ax-i2m1 11181  ax-1ne0 11182  ax-1rid 11183  ax-rnegex 11184  ax-rrecex 11185  ax-cnre 11186  ax-pre-lttri 11187  ax-pre-lttrn 11188  ax-pre-ltadd 11189  ax-pre-mulgt0 11190

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rmo 3375  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-tp 4633  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7368  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7859  df-1st 7978  df-2nd 7979  df-tpos 8214  df-frecs 8269  df-wrecs 8300  df-recs 8374  df-rdg 8413  df-1o 8469  df-er 8706  df-map 8825  df-pm 8826  df-ixp 8895  df-en 8943  df-dom 8944  df-sdom 8945  df-fin 8946  df-pnf 11255  df-mnf 11256  df-xr 11257  df-ltxr 11258  df-le 11259  df-sub 11451  df-neg 11452  df-nn 12218  df-2 12280  df-3 12281  df-4 12282  df-5 12283  df-6 12284  df-7 12285  df-8 12286  df-9 12287  df-n0 12478  df-z 12564  df-dec 12683  df-uz 12828  df-fz 13490  df-struct 17085  df-sets 17102  df-slot 17120  df-ndx 17132  df-base 17150  df-ress 17179  df-hom 17226  df-cco 17227  df-cat 17617  df-cid 17618  df-homf 17619  df-comf 17620  df-oppc 17661  df-sect 17699  df-inv 17700  df-iso 17701  df-ssc 17762  df-resc 17763  df-subc 17764  df-func 17813  df-cofu 17815  df-full 17860  df-fth 17861  df-nat 17899  df-fuc 17900  df-setc 18031  df-xpc 18129  df-1stf 18130  df-2ndf 18131  df-prf 18132  df-evlf 18171  df-curf 18172  df-hof 18208  df-yon 18209

This theorem is referenced by:  yoniso  18243