Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  upciclem3 Structured version   Visualization version   GIF version

Theorem upciclem3 50094
Description: Lemma for upciclem4 50095. (Contributed by Zhi Wang, 17-Sep-2025.)
Hypotheses
Ref Expression
upcic.b 𝐵 = (Base‘𝐷)
upcic.c 𝐶 = (Base‘𝐸)
upcic.h 𝐻 = (Hom ‘𝐷)
upcic.j 𝐽 = (Hom ‘𝐸)
upcic.o 𝑂 = (comp‘𝐸)
upcic.f (𝜑𝐹(𝐷 Func 𝐸)𝐺)
upcic.x (𝜑𝑋𝐵)
upcic.y (𝜑𝑌𝐵)
upcic.z (𝜑𝑍𝐶)
upcic.m (𝜑𝑀 ∈ (𝑍𝐽(𝐹𝑋)))
upcic.1 (𝜑 → ∀𝑤𝐵𝑓 ∈ (𝑍𝐽(𝐹𝑤))∃!𝑘 ∈ (𝑋𝐻𝑤)𝑓 = (((𝑋𝐺𝑤)‘𝑘)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑤))𝑀))
upciclem3.od · = (comp‘𝐷)
upciclem3.k (𝜑𝐾 ∈ (𝑋𝐻𝑌))
upciclem3.l (𝜑𝐿 ∈ (𝑌𝐻𝑋))
upciclem3.mn (𝜑𝑀 = (((𝑌𝐺𝑋)‘𝐿)(⟨𝑍, (𝐹𝑌)⟩𝑂(𝐹𝑋))𝑁))
upciclem3.nm (𝜑𝑁 = (((𝑋𝐺𝑌)‘𝐾)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀))
Assertion
Ref Expression
upciclem3 (𝜑 → (𝐿(⟨𝑋, 𝑌· 𝑋)𝐾) = ((Id‘𝐷)‘𝑋))
Distinct variable groups:   𝑤,𝐵   𝑓,𝐹,𝑘,𝑤   𝑓,𝐺,𝑘,𝑤   𝑓,𝐻,𝑘,𝑤   𝑓,𝐽,𝑤   𝑓,𝑀,𝑘,𝑤   𝑓,𝑂,𝑘,𝑤   𝑓,𝑋,𝑘,𝑤   𝑓,𝑍,𝑘,𝑤
Allowed substitution hints:   𝜑(𝑤, 𝑓, 𝑘)   𝐵(𝑓, 𝑘)   𝐶(𝑤, 𝑓, 𝑘)   𝐷(𝑤, 𝑓, 𝑘)   · (𝑤, 𝑓, 𝑘)   𝐸(𝑤, 𝑓, 𝑘)   𝐽(𝑘)   𝐾(𝑤, 𝑓, 𝑘)   𝐿(𝑤, 𝑓, 𝑘)   𝑁(𝑤, 𝑓, 𝑘)   𝑌(𝑤, 𝑓, 𝑘)

Proof of Theorem upciclem3
Dummy variable 𝑝 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6878 . . . 4 (𝑝 = (𝐿(⟨𝑋, 𝑌· 𝑋)𝐾) → ((𝑋𝐺𝑋)‘𝑝) = ((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌· 𝑋)𝐾)))
21oveq1d 7428 . . 3 (𝑝 = (𝐿(⟨𝑋, 𝑌· 𝑋)𝐾) → (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀) = (((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌· 𝑋)𝐾))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀))
32eqeq2d 2771 . 2 (𝑝 = (𝐿(⟨𝑋, 𝑌· 𝑋)𝐾) → (𝑀 = (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀) ↔ 𝑀 = (((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌· 𝑋)𝐾))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀)))
4 fveq2 6878 . . . 4 (𝑝 = ((Id‘𝐷)‘𝑋) → ((𝑋𝐺𝑋)‘𝑝) = ((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋)))
54oveq1d 7428 . . 3 (𝑝 = ((Id‘𝐷)‘𝑋) → (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀) = (((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀))
65eqeq2d 2771 . 2 (𝑝 = ((Id‘𝐷)‘𝑋) → (𝑀 = (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀) ↔ 𝑀 = (((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀)))
7 upcic.1 . . 3 (𝜑 → ∀𝑤𝐵𝑓 ∈ (𝑍𝐽(𝐹𝑤))∃!𝑘 ∈ (𝑋𝐻𝑤)𝑓 = (((𝑋𝐺𝑤)‘𝑘)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑤))𝑀))
8 upcic.x . . 3 (𝜑𝑋𝐵)
9 upcic.m . . 3 (𝜑𝑀 ∈ (𝑍𝐽(𝐹𝑋)))
107, 8, 9upciclem1 50092 . 2 (𝜑 → ∃!𝑝 ∈ (𝑋𝐻𝑋)𝑀 = (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀))
11 upcic.b . . 3 𝐵 = (Base‘𝐷)
12 upcic.h . . 3 𝐻 = (Hom ‘𝐷)
13 upciclem3.od . . 3 · = (comp‘𝐷)
14 upcic.f . . . 4 (𝜑𝐹(𝐷 Func 𝐸)𝐺)
1514funcrcl2 50005 . . 3 (𝜑𝐷 ∈ Cat)
16 upcic.y . . 3 (𝜑𝑌𝐵)
17 upciclem3.k . . 3 (𝜑𝐾 ∈ (𝑋𝐻𝑌))
18 upciclem3.l . . 3 (𝜑𝐿 ∈ (𝑌𝐻𝑋))
1911, 12, 13, 15, 8, 16, 8, 17, 18catcocl 17773 . 2 (𝜑 → (𝐿(⟨𝑋, 𝑌· 𝑋)𝐾) ∈ (𝑋𝐻𝑋))
20 eqid 2760 . . 3 (Id‘𝐷) = (Id‘𝐷)
2111, 12, 20, 15, 8catidcl 17770 . 2 (𝜑 → ((Id‘𝐷)‘𝑋) ∈ (𝑋𝐻𝑋))
22 upciclem3.mn . . 3 (𝜑𝑀 = (((𝑌𝐺𝑋)‘𝐿)(⟨𝑍, (𝐹𝑌)⟩𝑂(𝐹𝑋))𝑁))
23 upcic.c . . . 4 𝐶 = (Base‘𝐸)
24 upcic.j . . . 4 𝐽 = (Hom ‘𝐸)
25 upcic.o . . . 4 𝑂 = (comp‘𝐸)
26 upcic.z . . . 4 (𝜑𝑍𝐶)
27 upciclem3.nm . . . 4 (𝜑𝑁 = (((𝑋𝐺𝑌)‘𝐾)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀))
2811, 23, 12, 24, 25, 14, 8, 16, 8, 26, 9, 13, 17, 18, 27upciclem2 50093 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌· 𝑋)𝐾))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀) = (((𝑌𝐺𝑋)‘𝐿)(⟨𝑍, (𝐹𝑌)⟩𝑂(𝐹𝑋))𝑁))
2922, 28eqtr4d 2798 . 2 (𝜑𝑀 = (((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌· 𝑋)𝐾))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀))
30 eqid 2760 . . . . 5 (Id‘𝐸) = (Id‘𝐸)
3111, 20, 30, 14, 8funcid 17959 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋)) = ((Id‘𝐸)‘(𝐹𝑋)))
3231oveq1d 7428 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀) = (((Id‘𝐸)‘(𝐹𝑋))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀))
3314funcrcl3 50006 . . . 4 (𝜑𝐸 ∈ Cat)
3411, 23, 14funcf1 17955 . . . . 5 (𝜑𝐹:𝐵𝐶)
3534, 8ffvelcdmd 7078 . . . 4 (𝜑 → (𝐹𝑋) ∈ 𝐶)
3623, 24, 30, 33, 26, 25, 35, 9catlid 17771 . . 3 (𝜑 → (((Id‘𝐸)‘(𝐹𝑋))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀) = 𝑀)
3732, 36eqtr2d 2796 . 2 (𝜑𝑀 = (((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋))(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑋))𝑀))
383, 6, 10, 19, 21, 29, 37reu2eqd 3694 1 (𝜑 → (𝐿(⟨𝑋, 𝑌· 𝑋)𝐾) = ((Id‘𝐷)‘𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  wral 3076  ∃!wreu 3363  cop 4590   class class class wbr 5103  cfv 6533  (class class class)co 7413  Basecbs 17301  Hom chom 17353  compcco 17354  Idccid 17753   Func cfunc 17943
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  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-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-map 8828  df-ixp 8905  df-cat 17756  df-cid 17757  df-func 17947
This theorem is used by:  upciclem4  50095
  Copyright terms: Public domain W3C validator