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

Theorem yonedalem3a 18474
Description: Lemma for yoneda 18483. (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 6909 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ((1st ‘𝑌)‘𝑥) = ((1st ‘𝑌)‘𝑋))
5 simpl 488 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → 𝑓 = 𝐹)
64, 5oveq12d 7458 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) = (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
73fveq2d 6909 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (𝑎‘𝑥) = (𝑎‘𝑋))
83fveq2d 6909 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ( 1 ‘𝑥) = ( 1 ‘𝑋))
97, 8fveq12d 6912 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ((𝑎‘𝑥)‘( 1 ‘𝑥)) = ((𝑎‘𝑋)‘( 1 ‘𝑋)))
106, 9mpteq12dv 5195 . . . 4 ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥))) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
11 yonedalem3a.m . . . 4 𝑀 = (𝑓 ∈ (𝑂 Func 𝑆), 𝑥 ∈ 𝐵 ↦ (𝑎 ∈ (((1st ‘𝑌)‘𝑥)(𝑂 Nat 𝑆)𝑓) ↦ ((𝑎‘𝑥)‘( 1 ‘𝑥))))
12 ovex 7473 . . . . 5 (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ∈ V
1312mptex 7249 . . . 4 (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))) ∈ V
1410, 11, 13ovmpoa 7596 . . 3 ((𝐹 ∈ (𝑂 Func 𝑆) ∧ 𝑋 ∈ 𝐵) → (𝐹𝑀𝑋) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
151, 2, 14syl2anc 596 . 2 (𝜑 → (𝐹𝑀𝑋) = (𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹) ↦ ((𝑎‘𝑋)‘( 1 ‘𝑋))))
16 eqid 2763 . . . . . . 7 (𝑂 Nat 𝑆) = (𝑂 Nat 𝑆)
17 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
1816, 17nat1st2nd 18155 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑎 ∈ (⟨(1st ‘((1st ‘𝑌)‘𝑋)), (2nd ‘((1st ‘𝑌)‘𝑋))⟩(𝑂 Nat 𝑆)⟨(1st ‘𝐹), (2nd ‘𝐹)⟩))
19 yoneda.o . . . . . . . 8 𝑂 = (oppCat‘𝐶)
20 yoneda.b . . . . . . . 8 𝐵 = (Base‘𝐶)
2119, 20oppcbas 17918 . . . . . . 7 𝐵 = (Base‘𝑂)
22 eqid 2763 . . . . . . 7 (Hom ‘𝑆) = (Hom ‘𝑆)
232adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑋 ∈ 𝐵)
2416, 18, 21, 22, 23natcl 18157 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → (𝑎‘𝑋) ∈ (((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)(Hom ‘𝑆)((1st ‘𝐹)‘𝑋)))
25 yoneda.s . . . . . . 7 𝑆 = (SetCat‘𝑈)
26 yoneda.w . . . . . . . . 9 (𝜑 → 𝑉 ∈ 𝑊)
27 yoneda.v . . . . . . . . . 10 (𝜑 → (ran (Homf ‘𝑄) ∪ 𝑈) ⊆ 𝑉)
2827unssbd 4195 . . . . . . . . 9 (𝜑 → 𝑈 ⊆ 𝑉)
2926, 28ssexd 5290 . . . . . . . 8 (𝜑 → 𝑈 ∈ V)
3029adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → 𝑈 ∈ V)
31 eqid 2763 . . . . . . . . . . 11 (Base‘𝑆) = (Base‘𝑆)
32 relfunc 18063 . . . . . . . . . . . 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 18463 . . . . . . . . . . . 12 (𝜑 → ((1st ‘𝑌)‘𝑋) ∈ (𝑂 Func 𝑆))
37 1st2ndbr 8074 . . . . . . . . . . . 12 ((Rel (𝑂 Func 𝑆) ∧ ((1st ‘𝑌)‘𝑋) ∈ (𝑂 Func 𝑆)) → (1st ‘((1st ‘𝑌)‘𝑋))(𝑂 Func 𝑆)(2nd ‘((1st ‘𝑌)‘𝑋)))
3832, 36, 37sylancr 599 . . . . . . . . . . 11 (𝜑 → (1st ‘((1st ‘𝑌)‘𝑋))(𝑂 Func 𝑆)(2nd ‘((1st ‘𝑌)‘𝑋)))
3921, 31, 38funcf1 18067 . . . . . . . . . 10 (𝜑 → (1st ‘((1st ‘𝑌)‘𝑋)):𝐵⟶(Base‘𝑆))
4039, 2ffvelcdmd 7106 . . . . . . . . 9 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ (Base‘𝑆))
4125, 29setcbas 18279 . . . . . . . . 9 (𝜑 → 𝑈 = (Base‘𝑆))
4240, 41eleqtrrd 2867 . . . . . . . 8 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ 𝑈)
4342adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) ∈ 𝑈)
44 1st2ndbr 8074 . . . . . . . . . . . 12 ((Rel (𝑂 Func 𝑆) ∧ 𝐹 ∈ (𝑂 Func 𝑆)) → (1st ‘𝐹)(𝑂 Func 𝑆)(2nd ‘𝐹))
4532, 1, 44sylancr 599 . . . . . . . . . . 11 (𝜑 → (1st ‘𝐹)(𝑂 Func 𝑆)(2nd ‘𝐹))
4621, 31, 45funcf1 18067 . . . . . . . . . 10 (𝜑 → (1st ‘𝐹):𝐵⟶(Base‘𝑆))
4746, 2ffvelcdmd 7106 . . . . . . . . 9 (𝜑 → ((1st ‘𝐹)‘𝑋) ∈ (Base‘𝑆))
4847, 41eleqtrrd 2867 . . . . . . . 8 (𝜑 → ((1st ‘𝐹)‘𝑋) ∈ 𝑈)
4948adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((1st ‘𝐹)‘𝑋) ∈ 𝑈)
5025, 30, 22, 43, 49elsetchom 18282 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((𝑎‘𝑋) ∈ (((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)(Hom ‘𝑆)((1st ‘𝐹)‘𝑋)) ↔ (𝑎‘𝑋):((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)⟶((1st ‘𝐹)‘𝑋)))
5124, 50mpbid 235 . . . . 5 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → (𝑎‘𝑋):((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋)⟶((1st ‘𝐹)‘𝑋))
52 eqid 2763 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
53 yoneda.1 . . . . . . . 8 1 = (Id‘𝐶)
5420, 52, 53, 34, 2catidcl 17882 . . . . . . 7 (𝜑 → ( 1 ‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
5533, 20, 34, 2, 52, 2yon11 18464 . . . . . . 7 (𝜑 → ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋) = (𝑋(Hom ‘𝐶)𝑋))
5654, 55eleqtrrd 2867 . . . . . 6 (𝜑 → ( 1 ‘𝑋) ∈ ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋))
5756adantr 486 . . . . 5 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ( 1 ‘𝑋) ∈ ((1st ‘((1st ‘𝑌)‘𝑋))‘𝑋))
5851, 57ffvelcdmd 7106 . . . 4 ((𝜑 ∧ 𝑎 ∈ (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹)) → ((𝑎‘𝑋)‘( 1 ‘𝑋)) ∈ ((1st ‘𝐹)‘𝑋))
5958fmpttd 7136 . . 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 18473 . . . 4 (𝜑 → (𝐹(1st ‘𝑍)𝑋) = (((1st ‘𝑌)‘𝑋)(𝑂 Nat 𝑆)𝐹))
6719oppccat 17922 . . . . . 6 (𝐶 ∈ Cat → 𝑂 ∈ Cat)
6834, 67syl 18 . . . . 5 (𝜑 → 𝑂 ∈ Cat)
6925setccat 18286 . . . . . 6 (𝑈 ∈ V → 𝑆 ∈ Cat)
7029, 69syl 18 . . . . 5 (𝜑 → 𝑆 ∈ Cat)
7164, 68, 70, 21, 1, 2evlf1 18420 . . . 4 (𝜑 → (𝐹(1st ‘𝐸)𝑋) = ((1st ‘𝐹)‘𝑋))
7215, 66, 71feq123d 6717 . . 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 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  ⟨cop 4838   class class class wbr 5106   ↦ cmpt 5189  ran crn 5656  Rel wrel 5660  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442  1st c1st 8020  2nd c2nd 8021  tpos ctpos 8267  Basecbs 17413  Hom chom 17465  Catccat 17864  Idccid 17865  Homf chomf 17866  oppCatcoppc 17911   Func cfunc 18055   ∘func ccofu 18057   Nat cnat 18145   FuncCat cfuc 18146  SetCatcsetc 18276   ×c cxpc 18368   1stF c1stf 18369   2ndF c2ndf 18370   ⟨,⟩F cprf 18371   evalF cevlf 18409  HomFchof 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-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-hom 17478  df-cco 17479  df-cat 17868  df-cid 17869  df-homf 17870  df-comf 17871  df-oppc 17912  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:  yonedalem3b  18479  yonedalem3  18480  yonedainv  18481
  Copyright terms: Public domain W3C validator