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

Theorem yonedalem3a 18448
Description: Lemma for yoneda 18457. (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 6889 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ((1st ‘𝑌)‘𝑥) = ((1st ‘𝑌)‘𝑋))
5 simpl 488 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → 𝑓 = 𝐹)
64, 5oveq12d 7438 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) = (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
73fveq2d 6889 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (𝑎‘𝑥) = (𝑎‘𝑋))
83fveq2d 6889 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ( 1 ‘𝑥) = ( 1 ‘𝑋))
97, 8fveq12d 6892 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ((𝑎‘𝑥)‘( 1 ‘𝑥)) = ((𝑎‘𝑋)‘( 1 ‘𝑋)))
106, 9mpteq12dv 5191 . . . 4 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥))) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
11 yonedalem3a.m . . . 4 𝑀 = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥))))
12 ovex 7453 . . . . 5 (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ∈ V
1312mptex 7229 . . . 4 (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))) ∈ V
1410, 11, 13ovmpoa 7575 . . 3 ((𝐹 ∈ (𝑂 Func 𝑆) ∧ 𝑋 ∈ 𝐵) → (𝐹𝑀𝑋) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
151, 2, 14syl2anc 596 . 2 (𝜑 → (𝐹𝑀𝑋) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
16 eqid 2760 . . . . . . 7 (𝑂 Nat 𝑆) = (𝑂 Nat 𝑆)
17 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
1816, 17nat1st2nd 18129 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑎 ∈ (⟨(1st ‘((1st ‘𝑌)‘𝑋)), (2nd ‘((1st ‘𝑌)‘𝑋))⟩(𝑂 Nat 𝑆)⟨(1st ‘𝐹), (2nd ‘𝐹)⟩))
19 yoneda.o . . . . . . . 8 𝑂 = (oppCat‘𝐶)
20 yoneda.b . . . . . . . 8 𝐵 = (Base‘𝐶)
2119, 20oppcbas 17892 . . . . . . 7 𝐵 = (Base‘𝑂)
22 eqid 2760 . . . . . . 7 (Hom ‘𝑆) = (Hom ‘𝑆)
232adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑋 ∈ 𝐵)
2416, 18, 21, 22, 23natcl 18131 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → (𝑎‘𝑋) ∈ (((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)(Hom ‘𝑆)((1st ‘𝐹)‘𝑋)))
25 yoneda.s . . . . . . 7 𝑆 = (SetCat‘𝑈)
26 yoneda.w . . . . . . . . 9 (𝜑 → 𝑉 ∈ 𝑊)
27 yoneda.v . . . . . . . . . 10 (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ 𝑉)
2827unssbd 4192 . . . . . . . . 9 (𝜑 → 𝑈 ⊆ 𝑉)
2926, 28ssexd 5285 . . . . . . . 8 (𝜑 → 𝑈 ∈ V)
3029adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑈 ∈ V)
31 eqid 2760 . . . . . . . . . . 11 (Base‘𝑆) = (Base‘𝑆)
32 relfunc 18037 . . . . . . . . . . . 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 18437 . . . . . . . . . . . 12 (𝜑 → ((1st ‘𝑌)‘𝑋) ∈ (𝑂 Func 𝑆))
37 1st2ndbr 8053 . . . . . . . . . . . 12 ((Rel (𝑂 Func 𝑆) ∧ ((1st ‘𝑌)‘𝑋) ∈ (𝑂 Func 𝑆)) → (1st ‘((1st ‘𝑌)‘𝑋))(𝑂 Func 𝑆)(2nd ‘((1st ‘𝑌)‘𝑋)))
3832, 36, 37sylancr 599 . . . . . . . . . . 11 (𝜑 → (1st ‘((1st ‘𝑌)‘𝑋))(𝑂 Func 𝑆)(2nd ‘((1st ‘𝑌)‘𝑋)))
3921, 31, 38funcf1 18041 . . . . . . . . . 10 (𝜑 → (1st ‘((1st ‘𝑌)‘𝑋)):𝐵⟶(Base‘𝑆))
4039, 2ffvelcdmd 7085 . . . . . . . . 9 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ (Base‘𝑆))
4125, 29setcbas 18253 . . . . . . . . 9 (𝜑 → 𝑈 = (Base‘𝑆))
4240, 41eleqtrrd 2863 . . . . . . . 8 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ 𝑈)
4342adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ 𝑈)
44 1st2ndbr 8053 . . . . . . . . . . . 12 ((Rel (𝑂 Func 𝑆) ∧ 𝐹 ∈ (𝑂 Func 𝑆)) → (1st ‘𝐹)(𝑂 Func 𝑆)(2nd ‘𝐹))
4532, 1, 44sylancr 599 . . . . . . . . . . 11 (𝜑 → (1st ‘𝐹)(𝑂 Func 𝑆)(2nd ‘𝐹))
4621, 31, 45funcf1 18041 . . . . . . . . . 10 (𝜑 → (1st ‘𝐹):𝐵⟶(Base‘𝑆))
4746, 2ffvelcdmd 7085 . . . . . . . . 9 (𝜑 → ((1st ‘𝐹)‘𝑋) ∈ (Base‘𝑆))
4847, 41eleqtrrd 2863 . . . . . . . 8 (𝜑 → ((1st ‘𝐹)‘𝑋) ∈ 𝑈)
4948adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((1st ‘𝐹)‘𝑋) ∈ 𝑈)
5025, 30, 22, 43, 49elsetchom 18256 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((𝑎‘𝑋) ∈ (((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)(Hom ‘𝑆)((1st ‘𝐹)‘𝑋)) ↔ (𝑎‘𝑋):((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)⟶((1st ‘𝐹)‘𝑋)))
5124, 50mpbid 235 . . . . 5 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → (𝑎‘𝑋):((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)⟶((1st ‘𝐹)‘𝑋))
52 eqid 2760 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
53 yoneda.1 . . . . . . . 8 1 = (Id‘𝐶)
5420, 52, 53, 34, 2catidcl 17856 . . . . . . 7 (𝜑 → ( 1 ‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
5533, 20, 34, 2, 52, 2yon11 18438 . . . . . . 7 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) = (𝑋(Hom ‘𝐶)𝑋))
5654, 55eleqtrrd 2863 . . . . . 6 (𝜑 → ( 1 ‘𝑋) ∈ ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋))
5756adantr 486 . . . . 5 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ( 1 ‘𝑋) ∈ ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋))
5851, 57ffvelcdmd 7085 . . . 4 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((𝑎‘𝑋)‘( 1 ‘𝑋)) ∈ ((1st ‘𝐹)‘𝑋))
5958fmpttd 7115 . . 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 18447 . . . 4 (𝜑 → (𝐹(1st ‘𝑍)𝑋) = (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
6719oppccat 17896 . . . . . 6 (𝐶 ∈ Cat → 𝑂 ∈ Cat)
6834, 67syl 18 . . . . 5 (𝜑 → 𝑂 ∈ Cat)
6925setccat 18260 . . . . . 6 (𝑈 ∈ V → 𝑆 ∈ Cat)
7029, 69syl 18 . . . . 5 (𝜑 → 𝑆 ∈ Cat)
7164, 68, 70, 21, 1, 2evlf1 18394 . . . 4 (𝜑 → (𝐹(1st ‘𝐸)𝑋) = ((1st ‘𝐹)‘𝑋))
7215, 66, 71feq123d 6698 . . 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 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∪ cun 4149  ⟨cop 4589   class class class wbr 5102   ↦ cmpt 5185  ran crn 5651  Rel wrel 5655  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  1st c1st 7999  2nd c2nd 8000  tpos ctpos 8242  Basecbs 17387  Hom chom 17439  Catccat 17838  Idccid 17839  Homf chomf 17840  oppCatcoppc 17885   Func cfunc 18029   ∘func ccofu 18031   Nat cnat 18119   FuncCat cfuc 18120  SetCatcsetc 18250   ×c cxpc 18342   1stF c1stf 18343   2ndF c2ndf 18344   ⟨,⟩F cprf 18345   evalF cevlf 18383  HomFchof 18422  Yoncyon 18423
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-tpos 8243  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-er 8717  df-map 8849  df-ixp 8926  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-2 12405  df-3 12406  df-4 12407  df-5 12408  df-6 12409  df-7 12410  df-8 12411  df-9 12412  df-n0 12607  df-z 12694  df-dec 12815  df-uz 12966  df-fz 13640  df-struct 17325  df-sets 17342  df-slot 17360  df-ndx 17372  df-base 17388  df-hom 17452  df-cco 17453  df-cat 17842  df-cid 17843  df-homf 17844  df-comf 17845  df-oppc 17886  df-func 18033  df-cofu 18035  df-nat 18121  df-fuc 18122  df-setc 18251  df-xpc 18346  df-1stf 18347  df-2ndf 18348  df-prf 18349  df-evlf 18387  df-curf 18388  df-hof 18424  df-yon 18425
This theorem is used by:  yonedalem3b  18453  yonedalem3  18454  yonedainv  18455
  Copyright terms: Public domain W3C validator