Theorem upeu2lem 49515

Description: Lemma for upeu2 49659. 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

Step	Hyp	Ref	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‘𝐶)
9	1, 2, 8, 4, 5, 6	isohom 17734	. . . 4 ⊢ (𝜑 → (𝑌𝐼𝑋) ⊆ (𝑌𝐻𝑋))
10		eqid 2737	. . . . . 6 ⊢ (Inv‘𝐶) = (Inv‘𝐶)
11	1, 10, 4, 6, 5, 8	invf 17726	. . . . 5 ⊢ (𝜑 → (𝑋(Inv‘𝐶)𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋))
12		upeu2lem.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐼𝑌))
13	11, 12	ffvelcdmd 7031	. . . 4 ⊢ (𝜑 → ((𝑋(Inv‘𝐶)𝑌)‘𝐹) ∈ (𝑌𝐼𝑋))
14	9, 13	sseldd 3923	. . 3 ⊢ (𝜑 → ((𝑋(Inv‘𝐶)𝑌)‘𝐹) ∈ (𝑌𝐻𝑋))
15		upeu2lem.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝑋𝐻𝑍))
16	1, 2, 3, 4, 5, 6, 7, 14, 15	catcocl 17642	. 2 ⊢ (𝜑 → (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) ∈ (𝑌𝐻𝑍))
17		oveq1 7367	. . . . . 6 ⊢ (𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) → (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = ((𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
18	17	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)) → (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = ((𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
19	4	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → 𝐶 ∈ Cat)
20	5	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → 𝑌 ∈ 𝐵)
21	6	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → 𝑋 ∈ 𝐵)
22	14	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → ((𝑋(Inv‘𝐶)𝑌)‘𝐹) ∈ (𝑌𝐻𝑋))
23	1, 2, 8, 4, 6, 5	isohom 17734	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋𝐼𝑌) ⊆ (𝑋𝐻𝑌))
24	23, 12	sseldd 3923	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
25	24	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → 𝐹 ∈ (𝑋𝐻𝑌))
26	7	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → 𝑍 ∈ 𝐵)
27		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → 𝑘 ∈ (𝑌𝐻𝑍))
28	1, 2, 3, 19, 20, 21, 20, 22, 25, 26, 27	catass 17643	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → ((𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = (𝑘(⟨𝑌, 𝑌⟩ · 𝑍)(𝐹(⟨𝑌, 𝑋⟩ · 𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹))))
29	12	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → 𝐹 ∈ (𝑋𝐼𝑌))
30		eqid 2737	. . . . . . . . 9 ⊢ (Id‘𝐶) = (Id‘𝐶)
31	3	oveqi 7373	. . . . . . . . 9 ⊢ (⟨𝑌, 𝑋⟩ · 𝑌) = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)
32	1, 8, 10, 19, 21, 20, 29, 30, 31	isocoinvid 17751	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → (𝐹(⟨𝑌, 𝑋⟩ · 𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = ((Id‘𝐶)‘𝑌))
33	32	oveq2d 7376	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → (𝑘(⟨𝑌, 𝑌⟩ · 𝑍)(𝐹(⟨𝑌, 𝑋⟩ · 𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) = (𝑘(⟨𝑌, 𝑌⟩ · 𝑍)((Id‘𝐶)‘𝑌)))
34	1, 2, 30, 19, 20, 3, 26, 27	catrid 17641	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → (𝑘(⟨𝑌, 𝑌⟩ · 𝑍)((Id‘𝐶)‘𝑌)) = 𝑘)
35	28, 33, 34	3eqtrd 2776	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → ((𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = 𝑘)
36	35	adantr 480	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)) → ((𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) = 𝑘)
37	18, 36	eqtr2d 2773	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)) → 𝑘 = (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
38		oveq1 7367	. . . . . 6 ⊢ (𝑘 = (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) → (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = ((𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
39	38	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝑘 = (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) → (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = ((𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
40	15	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → 𝐺 ∈ (𝑋𝐻𝑍))
41	1, 2, 3, 19, 21, 20, 21, 25, 22, 26, 40	catass 17643	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → ((𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = (𝐺(⟨𝑋, 𝑋⟩ · 𝑍)(((𝑋(Inv‘𝐶)𝑌)‘𝐹)(⟨𝑋, 𝑌⟩ · 𝑋)𝐹)))
42	3	oveqi 7373	. . . . . . . . 9 ⊢ (⟨𝑋, 𝑌⟩ · 𝑋) = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)
43	1, 8, 10, 19, 21, 20, 29, 30, 42	invcoisoid 17750	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → (((𝑋(Inv‘𝐶)𝑌)‘𝐹)(⟨𝑋, 𝑌⟩ · 𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
44	43	oveq2d 7376	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → (𝐺(⟨𝑋, 𝑋⟩ · 𝑍)(((𝑋(Inv‘𝐶)𝑌)‘𝐹)(⟨𝑋, 𝑌⟩ · 𝑋)𝐹)) = (𝐺(⟨𝑋, 𝑋⟩ · 𝑍)((Id‘𝐶)‘𝑋)))
45	1, 2, 30, 19, 21, 3, 26, 40	catrid 17641	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → (𝐺(⟨𝑋, 𝑋⟩ · 𝑍)((Id‘𝐶)‘𝑋)) = 𝐺)
46	41, 44, 45	3eqtrd 2776	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → ((𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = 𝐺)
47	46	adantr 480	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝑘 = (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) → ((𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = 𝐺)
48	39, 47	eqtr2d 2773	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) ∧ 𝑘 = (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) → 𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
49	37, 48	impbida 801	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑌𝐻𝑍)) → (𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ↔ 𝑘 = (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))))
50	49	ralrimiva 3130	. 2 ⊢ (𝜑 → ∀𝑘 ∈ (𝑌𝐻𝑍)(𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ↔ 𝑘 = (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹))))
51		reu6i 3675	. 2 ⊢ (((𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)) ∈ (𝑌𝐻𝑍) ∧ ∀𝑘 ∈ (𝑌𝐻𝑍)(𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ↔ 𝑘 = (𝐺(⟨𝑌, 𝑋⟩ · 𝑍)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))) → ∃!𝑘 ∈ (𝑌𝐻𝑍)𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
52	16, 50, 51	syl2anc 585	1 ⊢ (𝜑 → ∃!𝑘 ∈ (𝑌𝐻𝑍)𝐺 = (𝑘(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃!wreu 3341  ⟨cop 4574  ‘cfv 6492  (class class class)co 7360  Basecbs 17170  Hom chom 17222  compcco 17223  Catccat 17621  Idccid 17622  Invcinv 17703  Isociso 17704

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-cat 17625  df-cid 17626  df-sect 17705  df-inv 17706  df-iso 17707

This theorem is referenced by:  upeu2  49659