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

Theorem upeu2lem 49863
Description: Lemma for upeu2 50007. There exists a unique morphism from 𝑌 to 𝑍 that commutes if 𝐹:𝑋𝑌 is an isomorphism. (Contributed by Zhi Wang, 20-Sep-2025.)
Hypotheses
Ref Expression
upeu2lem.b 𝐵 = (Base‘𝐶)
upeu2lem.h 𝐻 = (Hom ‘𝐶)
upeu2lem.o · = (comp‘𝐶)
upeu2lem.i 𝐼 = (Iso‘𝐶)
upeu2lem.c (𝜑𝐶 ∈ Cat)
upeu2lem.x (𝜑𝑋𝐵)
upeu2lem.y (𝜑𝑌𝐵)
upeu2lem.z (𝜑𝑍𝐵)
upeu2lem.f (𝜑𝐹 ∈ (𝑋𝐼𝑌))
upeu2lem.g (𝜑𝐺 ∈ (𝑋𝐻𝑍))
Assertion
Ref Expression
upeu2lem (𝜑 → ∃!𝑘 ∈ (𝑌𝐻𝑍)𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹))
Distinct variable groups:   · ,𝑘   𝐶,𝑘   𝑘,𝐹   𝑘,𝐺   𝑘,𝐻   𝑘,𝑋   𝑘,𝑌   𝑘,𝑍   𝜑,𝑘
Allowed substitution hints:   𝐵(𝑘)   𝐼(𝑘)

Proof of Theorem upeu2lem
StepHypRef Expression
1 upeu2lem.b . . 3 𝐵 = (Base‘𝐶)
2 upeu2lem.h . . 3 𝐻 = (Hom ‘𝐶)
3 upeu2lem.o . . 3 · = (comp‘𝐶)
4 upeu2lem.c . . 3 (𝜑𝐶 ∈ Cat)
5 upeu2lem.y . . 3 (𝜑𝑌𝐵)
6 upeu2lem.x . . 3 (𝜑𝑋𝐵)
7 upeu2lem.z . . 3 (𝜑𝑍𝐵)
8 upeu2lem.i . . . . 5 𝐼 = (Iso‘𝐶)
91, 2, 8, 4, 5, 6isohom 17855 . . . 4 (𝜑 → (𝑌𝐼𝑋) ⊆ (𝑌𝐻𝑋))
10 eqid 2765 . . . . . 6 (Inv‘𝐶) = (Inv‘𝐶)
111, 10, 4, 6, 5, 8invf 17847 . . . . 5 (𝜑 → (𝑋(Inv‘𝐶)𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋))
12 upeu2lem.f . . . . 5 (𝜑𝐹 ∈ (𝑋𝐼𝑌))
1311, 12ffvelcdmd 7084 . . . 4 (𝜑 → ((𝑋(Inv‘𝐶)𝑌)‘𝐹) ∈ (𝑌𝐼𝑋))
149, 13sseldd 3939 . . 3 (𝜑 → ((𝑋(Inv‘𝐶)𝑌)‘𝐹) ∈ (𝑌𝐻𝑋))
15 upeu2lem.g . . 3 (𝜑𝐺 ∈ (𝑋𝐻𝑍))
161, 2, 3, 4, 5, 6, 7, 14, 15catcocl 17763 . 2 (𝜑 → (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) ∈ (𝑌𝐻𝑍))
17 oveq1 7426 . . . . . 6 (𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹) → (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = ((𝑘(⟨𝑋, 𝑌· 𝑍)𝐹)(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
1817adantl 487 . . . . 5 (((𝜑𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹)) → (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = ((𝑘(⟨𝑋, 𝑌· 𝑍)𝐹)(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
194adantr 486 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → 𝐶 ∈ Cat)
205adantr 486 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → 𝑌𝐵)
216adantr 486 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → 𝑋𝐵)
2214adantr 486 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → ((𝑋(Inv‘𝐶)𝑌)‘𝐹) ∈ (𝑌𝐻𝑋))
231, 2, 8, 4, 6, 5isohom 17855 . . . . . . . . . 10 (𝜑 → (𝑋𝐼𝑌) ⊆ (𝑋𝐻𝑌))
2423, 12sseldd 3939 . . . . . . . . 9 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
2524adantr 486 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → 𝐹 ∈ (𝑋𝐻𝑌))
267adantr 486 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → 𝑍𝐵)
27 simpr 490 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → 𝑘 ∈ (𝑌𝐻𝑍))
281, 2, 3, 19, 20, 21, 20, 22, 25, 26, 27catass 17764 . . . . . . 7 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → ((𝑘(⟨𝑋, 𝑌· 𝑍)𝐹)(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = (𝑘(⟨𝑌, 𝑌· 𝑍)(𝐹(⟨𝑌, 𝑋· 𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹))))
2912adantr 486 . . . . . . . . 9 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → 𝐹 ∈ (𝑋𝐼𝑌))
30 eqid 2765 . . . . . . . . 9 (Id‘𝐶) = (Id‘𝐶)
313oveqi 7432 . . . . . . . . 9 (⟨𝑌, 𝑋· 𝑌) = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)
321, 8, 10, 19, 21, 20, 29, 30, 31isocoinvid 17872 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → (𝐹(⟨𝑌, 𝑋· 𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = ((Id‘𝐶)‘𝑌))
3332oveq2d 7435 . . . . . . 7 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → (𝑘(⟨𝑌, 𝑌· 𝑍)(𝐹(⟨𝑌, 𝑋· 𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) = (𝑘(⟨𝑌, 𝑌· 𝑍)((Id‘𝐶)‘𝑌)))
341, 2, 30, 19, 20, 3, 26, 27catrid 17762 . . . . . . 7 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → (𝑘(⟨𝑌, 𝑌· 𝑍)((Id‘𝐶)‘𝑌)) = 𝑘)
3528, 33, 343eqtrd 2804 . . . . . 6 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → ((𝑘(⟨𝑋, 𝑌· 𝑍)𝐹)(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = 𝑘)
3635adantr 486 . . . . 5 (((𝜑𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹)) → ((𝑘(⟨𝑋, 𝑌· 𝑍)𝐹)(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = 𝑘)
3718, 36eqtr2d 2801 . . . 4 (((𝜑𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹)) → 𝑘 = (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
38 oveq1 7426 . . . . . 6 (𝑘 = (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) → (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹) = ((𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌· 𝑍)𝐹))
3938adantl 487 . . . . 5 (((𝜑𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝑘 = (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) → (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹) = ((𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌· 𝑍)𝐹))
4015adantr 486 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → 𝐺 ∈ (𝑋𝐻𝑍))
411, 2, 3, 19, 21, 20, 21, 25, 22, 26, 40catass 17764 . . . . . . 7 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → ((𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌· 𝑍)𝐹) = (𝐺(⟨𝑋, 𝑋· 𝑍)(((𝑋(Inv‘𝐶)𝑌)‘𝐹)(⟨𝑋, 𝑌· 𝑋)𝐹)))
423oveqi 7432 . . . . . . . . 9 (⟨𝑋, 𝑌· 𝑋) = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)
431, 8, 10, 19, 21, 20, 29, 30, 42invcoisoid 17871 . . . . . . . 8 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → (((𝑋(Inv‘𝐶)𝑌)‘𝐹)(⟨𝑋, 𝑌· 𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
4443oveq2d 7435 . . . . . . 7 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → (𝐺(⟨𝑋, 𝑋· 𝑍)(((𝑋(Inv‘𝐶)𝑌)‘𝐹)(⟨𝑋, 𝑌· 𝑋)𝐹)) = (𝐺(⟨𝑋, 𝑋· 𝑍)((Id‘𝐶)‘𝑋)))
451, 2, 30, 19, 21, 3, 26, 40catrid 17762 . . . . . . 7 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → (𝐺(⟨𝑋, 𝑋· 𝑍)((Id‘𝐶)‘𝑋)) = 𝐺)
4641, 44, 453eqtrd 2804 . . . . . 6 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → ((𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌· 𝑍)𝐹) = 𝐺)
4746adantr 486 . . . . 5 (((𝜑𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝑘 = (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) → ((𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌· 𝑍)𝐹) = 𝐺)
4839, 47eqtr2d 2801 . . . 4 (((𝜑𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝑘 = (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) → 𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹))
4937, 48impbida 813 . . 3 ((𝜑𝑘 ∈ (𝑌𝐻𝑍)) → (𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹) ↔ 𝑘 = (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))))
5049ralrimiva 3159 . 2 (𝜑 → ∀𝑘 ∈ (𝑌𝐻𝑍)(𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹) ↔ 𝑘 = (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))))
51 reu6i 3693 . 2 (((𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) ∈ (𝑌𝐻𝑍) ∧ ∀𝑘 ∈ (𝑌𝐻𝑍)(𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹) ↔ 𝑘 = (𝐺(⟨𝑌, 𝑋· 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))) → ∃!𝑘 ∈ (𝑌𝐻𝑍)𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹))
5216, 50, 51syl2anc 596 1 (𝜑 → ∃!𝑘 ∈ (𝑌𝐻𝑍)𝐺 = (𝑘(⟨𝑋, 𝑌· 𝑍)𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wral 3081  ∃!wreu 3369  cop 4597  cfv 6540  (class class class)co 7419  Basecbs 17291  Hom chom 17343  compcco 17344  Catccat 17742  Idccid 17743  Invcinv 17824  Isociso 17825
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-cat 17746  df-cid 17747  df-sect 17826  df-inv 17827  df-iso 17828
This theorem is used by:  upeu2  50007
  Copyright terms: Public domain W3C validator