![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > yonffth | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
yonffth.y | ⊢ 𝑌 = (Yon‘𝐶) |
yonffth.o | ⊢ 𝑂 = (oppCat‘𝐶) |
yonffth.s | ⊢ 𝑆 = (SetCat‘𝑈) |
yonffth.q | ⊢ 𝑄 = (𝑂 FuncCat 𝑆) |
yonffth.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
yonffth.u | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
yonffth.h | ⊢ (𝜑 → ran (Homf ‘𝐶) ⊆ 𝑈) |
Ref | Expression |
---|---|
yonffth | ⊢ (𝜑 → 𝑌 ∈ ((𝐶 Full 𝑄) ∩ (𝐶 Faith 𝑄))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | yonffth.y | . 2 ⊢ 𝑌 = (Yon‘𝐶) | |
2 | eqid 2622 | . 2 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
3 | eqid 2622 | . 2 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
4 | yonffth.o | . 2 ⊢ 𝑂 = (oppCat‘𝐶) | |
5 | yonffth.s | . 2 ⊢ 𝑆 = (SetCat‘𝑈) | |
6 | eqid 2622 | . 2 ⊢ (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)) = (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)) | |
7 | yonffth.q | . 2 ⊢ 𝑄 = (𝑂 FuncCat 𝑆) | |
8 | eqid 2622 | . 2 ⊢ (HomF‘𝑄) = (HomF‘𝑄) | |
9 | eqid 2622 | . 2 ⊢ ((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈))) = ((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈))) | |
10 | eqid 2622 | . 2 ⊢ (𝑂 evalF 𝑆) = (𝑂 evalF 𝑆) | |
11 | eqid 2622 | . 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 6201 | . . . 4 ⊢ (Homf ‘𝑄) ∈ V | |
14 | 13 | rnex 7100 | . . 3 ⊢ ran (Homf ‘𝑄) ∈ V |
15 | yonffth.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
16 | unexg 6959 | . . 3 ⊢ ((ran (Homf ‘𝑄) ∈ V ∧ 𝑈 ∈ 𝑉) → (ran (Homf ‘𝑄) ∪ 𝑈) ∈ V) | |
17 | 14, 15, 16 | sylancr 695 | . 2 ⊢ (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ∈ V) |
18 | yonffth.h | . 2 ⊢ (𝜑 → ran (Homf ‘𝐶) ⊆ 𝑈) | |
19 | ssid 3624 | . . 3 ⊢ (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ (ran (Homf ‘𝑄) ∪ 𝑈) | |
20 | 19 | a1i 11 | . 2 ⊢ (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ (ran (Homf ‘𝑄) ∪ 𝑈)) |
21 | eqid 2622 | . 2 ⊢ (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘((Id‘𝐶)‘𝑥)))) = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘((Id‘𝐶)‘𝑥)))) | |
22 | eqid 2622 | . 2 ⊢ (Inv‘((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)))) = (Inv‘((𝑄 ×c 𝑂) FuncCat (SetCat‘(ran (Homf ‘𝑄) ∪ 𝑈)))) | |
23 | eqid 2622 | . 2 ⊢ (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑢 ∈ ((1st ‘𝑓)‘𝑥) ↦ (𝑦 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd ‘𝑓)𝑦)‘𝑔)‘𝑢))))) = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ (Base‘𝐶) ↦ (𝑢 ∈ ((1st ‘𝑓)‘𝑥) ↦ (𝑦 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd ‘𝑓)𝑦)‘𝑔)‘𝑢))))) | |
24 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 17, 18, 20, 21, 22, 23 | yonffthlem 16922 | 1 ⊢ (𝜑 → 𝑌 ∈ ((𝐶 Full 𝑄) ∩ (𝐶 Faith 𝑄))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ∪ cun 3572 ∩ cin 3573 ⊆ wss 3574 〈cop 4183 ↦ cmpt 4729 ran crn 5115 ‘cfv 5888 (class class class)co 6650 ↦ cmpt2 6652 1st c1st 7166 2nd c2nd 7167 tpos ctpos 7351 Basecbs 15857 Hom chom 15952 Catccat 16325 Idccid 16326 Homf chomf 16327 oppCatcoppc 16371 Invcinv 16405 Func cfunc 16514 ∘func ccofu 16516 Full cful 16562 Faith cfth 16563 Nat cnat 16601 FuncCat cfuc 16602 SetCatcsetc 16725 ×c cxpc 16808 1stF c1stf 16809 2ndF c2ndf 16810 〈,〉F cprf 16811 evalF cevlf 16849 HomFchof 16888 Yoncyon 16889 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-tpos 7352 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-ixp 7909 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-fz 12327 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-hom 15966 df-cco 15967 df-cat 16329 df-cid 16330 df-homf 16331 df-comf 16332 df-oppc 16372 df-sect 16407 df-inv 16408 df-iso 16409 df-ssc 16470 df-resc 16471 df-subc 16472 df-func 16518 df-cofu 16520 df-full 16564 df-fth 16565 df-nat 16603 df-fuc 16604 df-setc 16726 df-xpc 16812 df-1stf 16813 df-2ndf 16814 df-prf 16815 df-evlf 16853 df-curf 16854 df-hof 16890 df-yon 16891 |
This theorem is referenced by: yoniso 16925 |
Copyright terms: Public domain | W3C validator |