Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > yoneda | Structured version Visualization version GIF version |
Description: The Yoneda Lemma. There is a natural isomorphism between the functors 𝑍 and 𝐸, where 𝑍(𝐹, 𝑋) is the natural transformations from Yon(𝑋) = Hom ( − , 𝑋) to 𝐹, and 𝐸(𝐹, 𝑋) = 𝐹(𝑋) is the evaluation functor. Here we need two universes to state the claim: the smaller universe 𝑈 is used for forming the functor category 𝑄 = 𝐶 op → SetCat(𝑈), which itself does not (necessarily) live in 𝑈 but instead is an element of the larger universe 𝑉. (If 𝑈 is a Grothendieck universe, then it will be closed under this "presheaf" operation, and so we can set 𝑈 = 𝑉 in this case.) (Contributed by Mario Carneiro, 29-Jan-2017.) |
Ref | Expression |
---|---|
yoneda.y | ⊢ 𝑌 = (Yon‘𝐶) |
yoneda.b | ⊢ 𝐵 = (Base‘𝐶) |
yoneda.1 | ⊢ 1 = (Id‘𝐶) |
yoneda.o | ⊢ 𝑂 = (oppCat‘𝐶) |
yoneda.s | ⊢ 𝑆 = (SetCat‘𝑈) |
yoneda.t | ⊢ 𝑇 = (SetCat‘𝑉) |
yoneda.q | ⊢ 𝑄 = (𝑂 FuncCat 𝑆) |
yoneda.h | ⊢ 𝐻 = (HomF‘𝑄) |
yoneda.r | ⊢ 𝑅 = ((𝑄 ×c 𝑂) FuncCat 𝑇) |
yoneda.e | ⊢ 𝐸 = (𝑂 evalF 𝑆) |
yoneda.z | ⊢ 𝑍 = (𝐻 ∘func ((〈(1st ‘𝑌), tpos (2nd ‘𝑌)〉 ∘func (𝑄 2ndF 𝑂)) 〈,〉F (𝑄 1stF 𝑂))) |
yoneda.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
yoneda.w | ⊢ (𝜑 → 𝑉 ∈ 𝑊) |
yoneda.u | ⊢ (𝜑 → ran (Homf ‘𝐶) ⊆ 𝑈) |
yoneda.v | ⊢ (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ 𝑉) |
yoneda.m | ⊢ 𝑀 = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥)))) |
yoneda.i | ⊢ 𝐼 = (Iso‘𝑅) |
Ref | Expression |
---|---|
yoneda | ⊢ (𝜑 → 𝑀 ∈ (𝑍𝐼𝐸)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | yoneda.r | . . 3 ⊢ 𝑅 = ((𝑄 ×c 𝑂) FuncCat 𝑇) | |
2 | 1 | fucbas 17593 | . 2 ⊢ ((𝑄 ×c 𝑂) Func 𝑇) = (Base‘𝑅) |
3 | eqid 2738 | . 2 ⊢ (Inv‘𝑅) = (Inv‘𝑅) | |
4 | yoneda.y | . . . . . . 7 ⊢ 𝑌 = (Yon‘𝐶) | |
5 | yoneda.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐶) | |
6 | yoneda.1 | . . . . . . 7 ⊢ 1 = (Id‘𝐶) | |
7 | yoneda.o | . . . . . . 7 ⊢ 𝑂 = (oppCat‘𝐶) | |
8 | yoneda.s | . . . . . . 7 ⊢ 𝑆 = (SetCat‘𝑈) | |
9 | yoneda.t | . . . . . . 7 ⊢ 𝑇 = (SetCat‘𝑉) | |
10 | yoneda.q | . . . . . . 7 ⊢ 𝑄 = (𝑂 FuncCat 𝑆) | |
11 | yoneda.h | . . . . . . 7 ⊢ 𝐻 = (HomF‘𝑄) | |
12 | yoneda.e | . . . . . . 7 ⊢ 𝐸 = (𝑂 evalF 𝑆) | |
13 | yoneda.z | . . . . . . 7 ⊢ 𝑍 = (𝐻 ∘func ((〈(1st ‘𝑌), tpos (2nd ‘𝑌)〉 ∘func (𝑄 2ndF 𝑂)) 〈,〉F (𝑄 1stF 𝑂))) | |
14 | yoneda.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
15 | yoneda.w | . . . . . . 7 ⊢ (𝜑 → 𝑉 ∈ 𝑊) | |
16 | yoneda.u | . . . . . . 7 ⊢ (𝜑 → ran (Homf ‘𝐶) ⊆ 𝑈) | |
17 | yoneda.v | . . . . . . 7 ⊢ (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ 𝑉) | |
18 | 4, 5, 6, 7, 8, 9, 10, 11, 1, 12, 13, 14, 15, 16, 17 | yonedalem1 17906 | . . . . . 6 ⊢ (𝜑 → (𝑍 ∈ ((𝑄 ×c 𝑂) Func 𝑇) ∧ 𝐸 ∈ ((𝑄 ×c 𝑂) Func 𝑇))) |
19 | 18 | simpld 494 | . . . . 5 ⊢ (𝜑 → 𝑍 ∈ ((𝑄 ×c 𝑂) Func 𝑇)) |
20 | funcrcl 17494 | . . . . 5 ⊢ (𝑍 ∈ ((𝑄 ×c 𝑂) Func 𝑇) → ((𝑄 ×c 𝑂) ∈ Cat ∧ 𝑇 ∈ Cat)) | |
21 | 19, 20 | syl 17 | . . . 4 ⊢ (𝜑 → ((𝑄 ×c 𝑂) ∈ Cat ∧ 𝑇 ∈ Cat)) |
22 | 21 | simpld 494 | . . 3 ⊢ (𝜑 → (𝑄 ×c 𝑂) ∈ Cat) |
23 | 21 | simprd 495 | . . 3 ⊢ (𝜑 → 𝑇 ∈ Cat) |
24 | 1, 22, 23 | fuccat 17604 | . 2 ⊢ (𝜑 → 𝑅 ∈ Cat) |
25 | 18 | simprd 495 | . 2 ⊢ (𝜑 → 𝐸 ∈ ((𝑄 ×c 𝑂) Func 𝑇)) |
26 | yoneda.i | . 2 ⊢ 𝐼 = (Iso‘𝑅) | |
27 | yoneda.m | . . 3 ⊢ 𝑀 = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥)))) | |
28 | eqid 2738 | . . 3 ⊢ (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑢 ∈ ((1st ‘𝑓)‘𝑥) ↦ (𝑦 ∈ 𝐵 ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd ‘𝑓)𝑦)‘𝑔)‘𝑢))))) = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑢 ∈ ((1st ‘𝑓)‘𝑥) ↦ (𝑦 ∈ 𝐵 ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd ‘𝑓)𝑦)‘𝑔)‘𝑢))))) | |
29 | 4, 5, 6, 7, 8, 9, 10, 11, 1, 12, 13, 14, 15, 16, 17, 27, 3, 28 | yonedainv 17915 | . 2 ⊢ (𝜑 → 𝑀(𝑍(Inv‘𝑅)𝐸)(𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑢 ∈ ((1st ‘𝑓)‘𝑥) ↦ (𝑦 ∈ 𝐵 ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd ‘𝑓)𝑦)‘𝑔)‘𝑢)))))) |
30 | 2, 3, 24, 19, 25, 26, 29 | inviso1 17395 | 1 ⊢ (𝜑 → 𝑀 ∈ (𝑍𝐼𝐸)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∪ cun 3881 ⊆ 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 Isociso 17375 Func cfunc 17485 ∘func ccofu 17487 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-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: (None) |
Copyright terms: Public domain | W3C validator |