MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  yonffth Structured version   Visualization version   GIF version

Theorem yonffth 17918
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.
StepHypRef Expression
1 yonffth.y . 2 𝑌 = (Yon‘𝐶)
2 eqid 2738 . 2 (Base‘𝐶) = (Base‘𝐶)
3 eqid 2738 . 2 (Id‘𝐶) = (Id‘𝐶)
4 yonffth.o . 2 𝑂 = (oppCat‘𝐶)
5 yonffth.s . 2 𝑆 = (SetCat‘𝑈)
6 eqid 2738 . 2 (SetCat‘(ran (Homf𝑄) ∪ 𝑈)) = (SetCat‘(ran (Homf𝑄) ∪ 𝑈))
7 yonffth.q . 2 𝑄 = (𝑂 FuncCat 𝑆)
8 eqid 2738 . 2 (HomF𝑄) = (HomF𝑄)
9 eqid 2738 . 2 ((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf𝑄) ∪ 𝑈))) = ((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf𝑄) ∪ 𝑈)))
10 eqid 2738 . 2 (𝑂 evalF 𝑆) = (𝑂 evalF 𝑆)
11 eqid 2738 . 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 6769 . . . 4 (Homf𝑄) ∈ V
1413rnex 7733 . . 3 ran (Homf𝑄) ∈ V
15 yonffth.u . . 3 (𝜑𝑈𝑉)
16 unexg 7577 . . 3 ((ran (Homf𝑄) ∈ V ∧ 𝑈𝑉) → (ran (Homf𝑄) ∪ 𝑈) ∈ V)
1714, 15, 16sylancr 586 . 2 (𝜑 → (ran (Homf𝑄) ∪ 𝑈) ∈ V)
18 yonffth.h . 2 (𝜑 → ran (Homf𝐶) ⊆ 𝑈)
19 ssidd 3940 . 2 (𝜑 → (ran (Homf𝑄) ∪ 𝑈) ⊆ (ran (Homf𝑄) ∪ 𝑈))
20 eqid 2738 . 2 (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑎 ∈ (((1st𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎𝑥)‘((Id‘𝐶)‘𝑥)))) = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑎 ∈ (((1st𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎𝑥)‘((Id‘𝐶)‘𝑥))))
21 eqid 2738 . 2 (Inv‘((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf𝑄) ∪ 𝑈)))) = (Inv‘((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf𝑄) ∪ 𝑈))))
22 eqid 2738 . 2 (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑢 ∈ ((1st𝑓)‘𝑥) ↦ (𝑦 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd𝑓)𝑦)‘𝑔)‘𝑢))))) = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑢 ∈ ((1st𝑓)‘𝑥) ↦ (𝑦 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd𝑓)𝑦)‘𝑔)‘𝑢)))))
231, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 17, 18, 19, 20, 21, 22yonffthlem 17916 1 (𝜑𝑌 ∈ ((𝐶 Full 𝑄) ∩ (𝐶 Faith 𝑄)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2108  Vcvv 3422  cun 3881  cin 3882  wss 3883  cop 4564  cmpt 5153  ran crn 5581  cfv 6418  (class class class)co 7255  cmpo 7257  1st c1st 7802  2nd c2nd 7803  tpos ctpos 8012  Basecbs 16840  Hom chom 16899  Catccat 17290  Idccid 17291  Homf chomf 17292  oppCatcoppc 17337  Invcinv 17374   Func cfunc 17485  func ccofu 17487   Full cful 17534   Faith cfth 17535   Nat cnat 17573   FuncCat cfuc 17574  SetCatcsetc 17706   ×c cxpc 17801   1stF c1stf 17802   2ndF c2ndf 17803   ⟨,⟩F cprf 17804   evalF cevlf 17843  HomFchof 17882  Yoncyon 17883
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-tpos 8013  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-er 8456  df-map 8575  df-pm 8576  df-ixp 8644  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-3 11967  df-4 11968  df-5 11969  df-6 11970  df-7 11971  df-8 11972  df-9 11973  df-n0 12164  df-z 12250  df-dec 12367  df-uz 12512  df-fz 13169  df-struct 16776  df-sets 16793  df-slot 16811  df-ndx 16823  df-base 16841  df-ress 16868  df-hom 16912  df-cco 16913  df-cat 17294  df-cid 17295  df-homf 17296  df-comf 17297  df-oppc 17338  df-sect 17376  df-inv 17377  df-iso 17378  df-ssc 17439  df-resc 17440  df-subc 17441  df-func 17489  df-cofu 17491  df-full 17536  df-fth 17537  df-nat 17575  df-fuc 17576  df-setc 17707  df-xpc 17805  df-1stf 17806  df-2ndf 17807  df-prf 17808  df-evlf 17847  df-curf 17848  df-hof 17884  df-yon 17885
This theorem is referenced by:  yoniso  17919
  Copyright terms: Public domain W3C validator