Theorem yonffth 18241

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

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  Vcvv 3430   ∪ cun 3888   ∩ cin 3889   ⊆ wss 3890  ⟨cop 4574   ↦ cmpt 5167  ran crn 5625  ‘cfv 6492  (class class class)co 7360   ∈ cmpo 7362  1^st c1st 7933  2^nd c2nd 7934  tpos ctpos 8168  Basecbs 17170  Hom chom 17222  Catccat 17621  Idccid 17622  Hom_f chomf 17623  oppCatcoppc 17668  Invcinv 17703   Func cfunc 17812   ∘_func ccofu 17814   Full cful 17862   Faith cfth 17863   Nat cnat 17902   FuncCat cfuc 17903  SetCatcsetc 18033   ×_c cxpc 18125   1^st_F c1stf 18126   2^nd_F c2ndf 18127   ⟨,⟩_F cprf 18128   eval_F cevlf 18166  Hom_Fchof 18205  Yoncyon 18206

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-tpos 8169  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-er 8636  df-map 8768  df-pm 8769  df-ixp 8839  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-9 12242  df-n0 12429  df-z 12516  df-dec 12636  df-uz 12780  df-fz 13453  df-struct 17108  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-hom 17235  df-cco 17236  df-cat 17625  df-cid 17626  df-homf 17627  df-comf 17628  df-oppc 17669  df-sect 17705  df-inv 17706  df-iso 17707  df-ssc 17768  df-resc 17769  df-subc 17770  df-func 17816  df-cofu 17818  df-full 17864  df-fth 17865  df-nat 17904  df-fuc 17905  df-setc 18034  df-xpc 18129  df-1stf 18130  df-2ndf 18131  df-prf 18132  df-evlf 18170  df-curf 18171  df-hof 18207  df-yon 18208

This theorem is referenced by:  yoniso  18242