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

Theorem yonedalem3a 18500
Description: Lemma for yoneda 18509. (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 ‘𝑄) ∪ 𝑈) ⊆ 𝑉)
yonedalem21.f (𝜑 → 𝐹 ∈ (𝑂 Func 𝑆))
yonedalem21.x (𝜑 → 𝑋 ∈ 𝐵)
yonedalem3a.m 𝑀 = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥))))
Assertion
Ref Expression
yonedalem3a (𝜑 → ((𝐹𝑀𝑋) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))) ∧ (𝐹𝑀𝑋):(𝐹(1st ‘𝑍)𝑋)⟶(𝐹(1st ‘𝐸)𝑋)))
Distinct variable groups:   𝑓,𝑎,𝑥, 1   𝐶,𝑎,𝑓,𝑥   𝐸,𝑎,𝑓   𝐹,𝑎,𝑓,𝑥   𝐵,𝑎,𝑓,𝑥   𝑂,𝑎,𝑓,𝑥   𝑆,𝑎,𝑓,𝑥   𝑄,𝑎,𝑓,𝑥   𝑇,𝑓   𝜑,𝑎,𝑓,𝑥   𝑌,𝑎,𝑓,𝑥   𝑍,𝑎,𝑓,𝑥   𝑋,𝑎,𝑓,𝑥
Allowed substitution hints:   𝑅(𝑥, 𝑓, 𝑎)   𝑇(𝑥, 𝑎)   𝑈(𝑥, 𝑓, 𝑎)   𝐸(𝑥)   𝐻(𝑥, 𝑓, 𝑎)   𝑀(𝑥, 𝑓, 𝑎)   𝑉(𝑥, 𝑓, 𝑎)   𝑊(𝑥, 𝑓, 𝑎)

Proof of Theorem yonedalem3a
StepHypRef Expression
1 yonedalem21.f . . 3 (𝜑 → 𝐹 ∈ (𝑂 Func 𝑆))
2 yonedalem21.x . . 3 (𝜑 → 𝑋 ∈ 𝐵)
3 simpr 490 . . . . . . 7 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
43fveq2d 6919 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ((1st ‘𝑌)‘𝑥) = ((1st ‘𝑌)‘𝑋))
5 simpl 488 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → 𝑓 = 𝐹)
64, 5oveq12d 7468 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) = (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
73fveq2d 6919 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (𝑎‘𝑥) = (𝑎‘𝑋))
83fveq2d 6919 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ( 1 ‘𝑥) = ( 1 ‘𝑋))
97, 8fveq12d 6922 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ((𝑎‘𝑥)‘( 1 ‘𝑥)) = ((𝑎‘𝑋)‘( 1 ‘𝑋)))
106, 9mpteq12dv 5197 . . . 4 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥))) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
11 yonedalem3a.m . . . 4 𝑀 = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥))))
12 ovex 7483 . . . . 5 (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ∈ V
1312mptex 7259 . . . 4 (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))) ∈ V
1410, 11, 13ovmpoa 7606 . . 3 ((𝐹 ∈ (𝑂 Func 𝑆) ∧ 𝑋 ∈ 𝐵) → (𝐹𝑀𝑋) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
151, 2, 14syl2anc 596 . 2 (𝜑 → (𝐹𝑀𝑋) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
16 eqid 2766 . . . . . . 7 (𝑂 Nat 𝑆) = (𝑂 Nat 𝑆)
17 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
1816, 17nat1st2nd 18181 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑎 ∈ (⟨(1st ‘((1st ‘𝑌)‘𝑋)), (2nd ‘((1st ‘𝑌)‘𝑋))⟩(𝑂 Nat 𝑆)⟨(1st ‘𝐹), (2nd ‘𝐹)⟩))
19 yoneda.o . . . . . . . 8 𝑂 = (oppCat‘𝐶)
20 yoneda.b . . . . . . . 8 𝐵 = (Base‘𝐶)
2119, 20oppcbas 17944 . . . . . . 7 𝐵 = (Base‘𝑂)
22 eqid 2766 . . . . . . 7 (Hom ‘𝑆) = (Hom ‘𝑆)
232adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑋 ∈ 𝐵)
2416, 18, 21, 22, 23natcl 18183 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → (𝑎‘𝑋) ∈ (((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)(Hom ‘𝑆)((1st ‘𝐹)‘𝑋)))
25 yoneda.s . . . . . . 7 𝑆 = (SetCat‘𝑈)
26 yoneda.w . . . . . . . . 9 (𝜑 → 𝑉 ∈ 𝑊)
27 yoneda.v . . . . . . . . . 10 (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ 𝑉)
2827unssbd 4194 . . . . . . . . 9 (𝜑 → 𝑈 ⊆ 𝑉)
2926, 28ssexd 5292 . . . . . . . 8 (𝜑 → 𝑈 ∈ V)
3029adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑈 ∈ V)
31 eqid 2766 . . . . . . . . . . 11 (Base‘𝑆) = (Base‘𝑆)
32 relfunc 18089 . . . . . . . . . . . 12 Rel (𝑂 Func 𝑆)
33 yoneda.y . . . . . . . . . . . . 13 𝑌 = (Yon‘𝐶)
34 yoneda.c . . . . . . . . . . . . 13 (𝜑 → 𝐶 ∈ Cat)
35 yoneda.u . . . . . . . . . . . . 13 (𝜑 → ran (Homf ‘𝐶) ⊆ 𝑈)
3633, 20, 34, 2, 19, 25, 29, 35yon1cl 18489 . . . . . . . . . . . 12 (𝜑 → ((1st ‘𝑌)‘𝑋) ∈ (𝑂 Func 𝑆))
37 1st2ndbr 8086 . . . . . . . . . . . 12 ((Rel (𝑂 Func 𝑆) ∧ ((1st ‘𝑌)‘𝑋) ∈ (𝑂 Func 𝑆)) → (1st ‘((1st ‘𝑌)‘𝑋))(𝑂 Func 𝑆)(2nd ‘((1st ‘𝑌)‘𝑋)))
3832, 36, 37sylancr 599 . . . . . . . . . . 11 (𝜑 → (1st ‘((1st ‘𝑌)‘𝑋))(𝑂 Func 𝑆)(2nd ‘((1st ‘𝑌)‘𝑋)))
3921, 31, 38funcf1 18093 . . . . . . . . . 10 (𝜑 → (1st ‘((1st ‘𝑌)‘𝑋)):𝐵⟶(Base‘𝑆))
4039, 2ffvelcdmd 7116 . . . . . . . . 9 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ (Base‘𝑆))
4125, 29setcbas 18305 . . . . . . . . 9 (𝜑 → 𝑈 = (Base‘𝑆))
4240, 41eleqtrrd 2870 . . . . . . . 8 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ 𝑈)
4342adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ 𝑈)
44 1st2ndbr 8086 . . . . . . . . . . . 12 ((Rel (𝑂 Func 𝑆) ∧ 𝐹 ∈ (𝑂 Func 𝑆)) → (1st ‘𝐹)(𝑂 Func 𝑆)(2nd ‘𝐹))
4532, 1, 44sylancr 599 . . . . . . . . . . 11 (𝜑 → (1st ‘𝐹)(𝑂 Func 𝑆)(2nd ‘𝐹))
4621, 31, 45funcf1 18093 . . . . . . . . . 10 (𝜑 → (1st ‘𝐹):𝐵⟶(Base‘𝑆))
4746, 2ffvelcdmd 7116 . . . . . . . . 9 (𝜑 → ((1st ‘𝐹)‘𝑋) ∈ (Base‘𝑆))
4847, 41eleqtrrd 2870 . . . . . . . 8 (𝜑 → ((1st ‘𝐹)‘𝑋) ∈ 𝑈)
4948adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((1st ‘𝐹)‘𝑋) ∈ 𝑈)
5025, 30, 22, 43, 49elsetchom 18308 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((𝑎‘𝑋) ∈ (((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)(Hom ‘𝑆)((1st ‘𝐹)‘𝑋)) ↔ (𝑎‘𝑋):((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)⟶((1st ‘𝐹)‘𝑋)))
5124, 50mpbid 235 . . . . 5 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → (𝑎‘𝑋):((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)⟶((1st ‘𝐹)‘𝑋))
52 eqid 2766 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
53 yoneda.1 . . . . . . . 8 1 = (Id‘𝐶)
5420, 52, 53, 34, 2catidcl 17908 . . . . . . 7 (𝜑 → ( 1 ‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
5533, 20, 34, 2, 52, 2yon11 18490 . . . . . . 7 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) = (𝑋(Hom ‘𝐶)𝑋))
5654, 55eleqtrrd 2870 . . . . . 6 (𝜑 → ( 1 ‘𝑋) ∈ ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋))
5756adantr 486 . . . . 5 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ( 1 ‘𝑋) ∈ ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋))
5851, 57ffvelcdmd 7116 . . . 4 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((𝑎‘𝑋)‘( 1 ‘𝑋)) ∈ ((1st ‘𝐹)‘𝑋))
5958fmpttd 7146 . . 3 (𝜑 → (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))):(((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)⟶((1st ‘𝐹)‘𝑋))
60 yoneda.t . . . . 5 𝑇 = (SetCat‘𝑉)
61 yoneda.q . . . . 5 𝑄 = (𝑂 FuncCat 𝑆)
62 yoneda.h . . . . 5 𝐻 = (HomF‘𝑄)
63 yoneda.r . . . . 5 𝑅 = ((𝑄 ×c 𝑂) FuncCat 𝑇)
64 yoneda.e . . . . 5 𝐸 = (𝑂 evalF 𝑆)
65 yoneda.z . . . . 5 𝑍 = (𝐻 ∘func ((⟨(1st ‘𝑌), tpos (2nd ‘𝑌)⟩ ∘func (𝑄 2ndF 𝑂)) ⟨,⟩F (𝑄 1stF 𝑂)))
6633, 20, 53, 19, 25, 60, 61, 62, 63, 64, 65, 34, 26, 35, 27, 1, 2yonedalem21 18499 . . . 4 (𝜑 → (𝐹(1st ‘𝑍)𝑋) = (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
6719oppccat 17948 . . . . . 6 (𝐶 ∈ Cat → 𝑂 ∈ Cat)
6834, 67syl 18 . . . . 5 (𝜑 → 𝑂 ∈ Cat)
6925setccat 18312 . . . . . 6 (𝑈 ∈ V → 𝑆 ∈ Cat)
7029, 69syl 18 . . . . 5 (𝜑 → 𝑆 ∈ Cat)
7164, 68, 70, 21, 1, 2evlf1 18446 . . . 4 (𝜑 → (𝐹(1st ‘𝐸)𝑋) = ((1st ‘𝐹)‘𝑋))
7215, 66, 71feq123d 6727 . . 3 (𝜑 → ((𝐹𝑀𝑋):(𝐹(1st ‘𝑍)𝑋)⟶(𝐹(1st ‘𝐸)𝑋) ↔ (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))):(((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)⟶((1st ‘𝐹)‘𝑋)))
7359, 72mpbird 260 . 2 (𝜑 → (𝐹𝑀𝑋):(𝐹(1st ‘𝑍)𝑋)⟶(𝐹(1st ‘𝐸)𝑋))
7415, 73jca 521 1 (𝜑 → ((𝐹𝑀𝑋) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))) ∧ (𝐹𝑀𝑋):(𝐹(1st ‘𝑍)𝑋)⟶(𝐹(1st ‘𝐸)𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  Vcvv 3453   ⊆ wss 3899   ∪ cun 4151  ⟨cop 4839   class class class wbr 5107   ↦ cmpt 5191  ran crn 5658  Rel wrel 5662  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452  1st c1st 8032  2nd c2nd 8033  tpos ctpos 8279  Basecbs 17433  Hom chom 17485  Catccat 17890  Idccid 17891  Homf chomf 17892  oppCatcoppc 17937   Func cfunc 18081   ∘func ccofu 18083   Nat cnat 18171   FuncCat cfuc 18172  SetCatcsetc 18302   ×c cxpc 18394   1stF c1stf 18395   2ndF c2ndf 18396   ⟨,⟩F cprf 18397   evalF cevlf 18435  HomFchof 18474  Yoncyon 18475
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-tpos 8280  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-er 8754  df-map 8886  df-ixp 8963  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-z 12733  df-dec 12854  df-uz 13005  df-fz 13679  df-struct 17371  df-sets 17388  df-slot 17406  df-ndx 17418  df-base 17434  df-hom 17499  df-cco 17500  df-cat 17894  df-cid 17895  df-homf 17896  df-comf 17897  df-oppc 17938  df-func 18085  df-cofu 18087  df-nat 18173  df-fuc 18174  df-setc 18303  df-xpc 18398  df-1stf 18399  df-2ndf 18400  df-prf 18401  df-evlf 18439  df-curf 18440  df-hof 18476  df-yon 18477
This theorem is used by:  yonedalem3b  18505  yonedalem3  18506  yonedainv  18507
  Copyright terms: Public domain W3C validator