Theorem yoneda 18483

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.)

Hypotheses

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‘𝑅)

Assertion

Ref	Expression
yoneda	⊢ (𝜑 → 𝑀 ∈ (𝑍𝐼𝐸))

Distinct variable groups:   𝑓,𝑎,𝑥, 1   𝐶,𝑎,𝑓,𝑥   𝐸,𝑎,𝑓   𝐵,𝑎,𝑓,𝑥   𝑂,𝑎,𝑓,𝑥   𝑆,𝑎,𝑓,𝑥   𝑄,𝑎,𝑓,𝑥   𝑇,𝑓   𝜑,𝑎,𝑓,𝑥   𝑌,𝑎,𝑓,𝑥   𝑍,𝑎,𝑓,𝑥

Allowed substitution hints:   𝑅(𝑥, 𝑓, 𝑎)   𝑇(𝑥, 𝑎)   𝑈(𝑥, 𝑓, 𝑎)   𝐸(𝑥)   𝐻(𝑥, 𝑓, 𝑎)   𝐼(𝑥, 𝑓, 𝑎)   𝑀(𝑥, 𝑓, 𝑎)   𝑉(𝑥, 𝑓, 𝑎)   𝑊(𝑥, 𝑓, 𝑎)

Proof of Theorem yoneda

Dummy variables 𝑔 𝑦 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		yoneda.r	. . 3 ⊢ 𝑅 = ((𝑄 ×c 𝑂) FuncCat 𝑇)
2	1	fucbas 18164	. 2 ⊢ ((𝑄 ×c 𝑂) Func 𝑇) = (Base‘𝑅)
3		eqid 2763	. 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 18472	. . . . . 6 ⊢ (𝜑 → (𝑍 ∈ ((𝑄 ×c 𝑂) Func 𝑇) ∧ 𝐸 ∈ ((𝑄 ×c 𝑂) Func 𝑇)))
19	18	simpld 500	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ ((𝑄 ×c 𝑂) Func 𝑇))
20		funcrcl 18064	. . . . 5 ⊢ (𝑍 ∈ ((𝑄 ×c 𝑂) Func 𝑇) → ((𝑄 ×c 𝑂) ∈ Cat ∧ 𝑇 ∈ Cat))
21	19, 20	syl 18	. . . 4 ⊢ (𝜑 → ((𝑄 ×c 𝑂) ∈ Cat ∧ 𝑇 ∈ Cat))
22	21	simpld 500	. . 3 ⊢ (𝜑 → (𝑄 ×c 𝑂) ∈ Cat)
23	21	simprd 501	. . 3 ⊢ (𝜑 → 𝑇 ∈ Cat)
24	1, 22, 23	fuccat 18174	. 2 ⊢ (𝜑 → 𝑅 ∈ Cat)
25	18	simprd 501	. 2 ⊢ (𝜑 → 𝐸 ∈ ((𝑄 ×c 𝑂) Func 𝑇))
26		yoneda.i	. 2 ⊢ 𝐼 = (Iso‘𝑅)
27		yoneda.m	. . 3 ⊢ 𝑀 = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥))))
28		eqid 2763	. . 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 18481	. 2 ⊢ (𝜑 → 𝑀(𝑍(Inv‘𝑅)𝐸)(𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑢 ∈ ((1st ‘𝑓)‘𝑥) ↦ (𝑦 ∈ 𝐵 ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥) ↦ (((𝑥(2nd ‘𝑓)𝑦)‘𝑔)‘𝑢))))))
30	2, 3, 24, 19, 25, 26, 29	inviso1 17967	1 ⊢ (𝜑 → 𝑀 ∈ (𝑍𝐼𝐸))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∪ cun 4152  ⟨cop 4838   ↦ cmpt 5189  ran crn 5656  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442  1^st c1st 8020  2^nd c2nd 8021  tpos ctpos 8267  Basecbs 17413  Hom chom 17465  Catccat 17864  Idccid 17865  Hom_f chomf 17866  oppCatcoppc 17911  Invcinv 17946  Isociso 17947   Func cfunc 18055   ∘_func ccofu 18057   Nat cnat 18145   FuncCat cfuc 18146  SetCatcsetc 18276   ×_c cxpc 18368   1^st_F c1stf 18369   2^nd_F c2ndf 18370   ⟨,⟩_F cprf 18371   eval_F cevlf 18409  Hom_Fchof 18448  Yoncyon 18449

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-tpos 8268  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-er 8742  df-map 8874  df-pm 8875  df-ixp 8951  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-nn 12360  df-2 12429  df-3 12430  df-4 12431  df-5 12432  df-6 12433  df-7 12434  df-8 12435  df-9 12436  df-n0 12631  df-z 12718  df-dec 12839  df-uz 12990  df-fz 13664  df-struct 17351  df-sets 17368  df-slot 17386  df-ndx 17398  df-base 17414  df-ress 17435  df-hom 17478  df-cco 17479  df-cat 17868  df-cid 17869  df-homf 17870  df-comf 17871  df-oppc 17912  df-sect 17948  df-inv 17949  df-iso 17950  df-ssc 18011  df-resc 18012  df-subc 18013  df-func 18059  df-cofu 18061  df-nat 18147  df-fuc 18148  df-setc 18277  df-xpc 18372  df-1stf 18373  df-2ndf 18374  df-prf 18375  df-evlf 18413  df-curf 18414  df-hof 18450  df-yon 18451

This theorem is used by: (None)