Theorem upeu 50618

Description: A universal property defines an essentially unique (strong form) pair of object 𝑋 and morphism 𝑀 if it exists. (Contributed by Zhi Wang, 19-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	⊢ (𝜑 → ∀𝑤 ∈ 𝐵 ∀𝑓 ∈ (𝑍𝐽(𝐹‘𝑤))∃!𝑘 ∈ (𝑋𝐻𝑤)𝑓 = (((𝑋𝐺𝑤)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑤))𝑀))
upcic.n	⊢ (𝜑 → 𝑁 ∈ (𝑍𝐽(𝐹‘𝑌)))
upcic.2	⊢ (𝜑 → ∀𝑣 ∈ 𝐵 ∀𝑔 ∈ (𝑍𝐽(𝐹‘𝑣))∃!𝑙 ∈ (𝑌𝐻𝑣)𝑔 = (((𝑌𝐺𝑣)‘𝑙)(⟨𝑍, (𝐹‘𝑌)⟩𝑂(𝐹‘𝑣))𝑁))

Assertion

Ref	Expression
upeu	⊢ (𝜑 → ∃!𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))

Distinct variable groups:   𝑣,𝐵   𝑤,𝐵   𝐷,𝑟   𝑓,𝐹,𝑘,𝑤   𝑔,𝐹,𝑙,𝑣   𝐹,𝑟   𝑓,𝐺,𝑘,𝑤   𝑔,𝐺,𝑙,𝑣   𝐺,𝑟   𝑓,𝐻,𝑘,𝑤   𝑔,𝐻,𝑙,𝑣   𝐻,𝑟   𝑓,𝐽,𝑤   𝑔,𝐽,𝑣   𝑓,𝑀,𝑘,𝑤   𝑔,𝑀,𝑙   𝑀,𝑟   𝑓,𝑁,𝑘   𝑔,𝑁,𝑙,𝑣   𝑁,𝑟   𝑓,𝑂,𝑘,𝑤   𝑔,𝑂,𝑙,𝑣   𝑂,𝑟   𝑓,𝑋,𝑘,𝑤   𝑔,𝑋,𝑙,𝑣   𝑋,𝑟   𝑓,𝑌,𝑘,𝑤   𝑔,𝑌,𝑙,𝑣   𝑌,𝑟   𝑓,𝑍,𝑘,𝑤   𝑔,𝑍,𝑙,𝑣   𝑍,𝑟

Allowed substitution hints:   𝜑(𝑤, 𝑣, 𝑓, 𝑔, 𝑘, 𝑟, 𝑙)   𝐵(𝑓, 𝑔, 𝑘, 𝑟, 𝑙)   𝐶(𝑤, 𝑣, 𝑓, 𝑔, 𝑘, 𝑟, 𝑙)   𝐷(𝑤, 𝑣, 𝑓, 𝑔, 𝑘, 𝑙)   𝐸(𝑤, 𝑣, 𝑓, 𝑔, 𝑘, 𝑟, 𝑙)   𝐽(𝑘, 𝑟, 𝑙)   𝑀(𝑣)   𝑁(𝑤)

Proof of Theorem upeu

Step	Hyp	Ref	Expression
1		upcic.b	. . . 4 ⊢ 𝐵 = (Base‘𝐷)
2		upcic.c	. . . 4 ⊢ 𝐶 = (Base‘𝐸)
3		upcic.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐷)
4		upcic.j	. . . 4 ⊢ 𝐽 = (Hom ‘𝐸)
5		upcic.o	. . . 4 ⊢ 𝑂 = (comp‘𝐸)
6		upcic.f	. . . 4 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
7		upcic.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
8		upcic.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
9		upcic.z	. . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐶)
10		upcic.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ (𝑍𝐽(𝐹‘𝑋)))
11		upcic.1	. . . 4 ⊢ (𝜑 → ∀𝑤 ∈ 𝐵 ∀𝑓 ∈ (𝑍𝐽(𝐹‘𝑤))∃!𝑘 ∈ (𝑋𝐻𝑤)𝑓 = (((𝑋𝐺𝑤)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑤))𝑀))
12		upcic.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (𝑍𝐽(𝐹‘𝑌)))
13		upcic.2	. . . 4 ⊢ (𝜑 → ∀𝑣 ∈ 𝐵 ∀𝑔 ∈ (𝑍𝐽(𝐹‘𝑣))∃!𝑙 ∈ (𝑌𝐻𝑣)𝑔 = (((𝑌𝐺𝑣)‘𝑙)(⟨𝑍, (𝐹‘𝑌)⟩𝑂(𝐹‘𝑣))𝑁))
14	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13	upciclem4 50616	. . 3 ⊢ (𝜑 → (𝑋( ≃𝑐 ‘𝐷)𝑌 ∧ ∃𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
15	14	simprd 501	. 2 ⊢ (𝜑 → ∃𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
16		eqid 2763	. . . 4 ⊢ (Iso‘𝐷) = (Iso‘𝐷)
17	6	funcrcl2 50524	. . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat)
18	1, 3, 16, 17, 7, 8	isohom 18001	. . 3 ⊢ (𝜑 → (𝑋(Iso‘𝐷)𝑌) ⊆ (𝑋𝐻𝑌))
19	11, 8, 12	upciclem1 50613	. . . 4 ⊢ (𝜑 → ∃!𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
20		reurmo 3372	. . . 4 ⊢ (∃!𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) → ∃*𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
21	19, 20	syl 18	. . 3 ⊢ (𝜑 → ∃*𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
22		nfcv 2926	. . . 4 ⊢ Ⅎ𝑟(𝑋(Iso‘𝐷)𝑌)
23		nfcv 2926	. . . 4 ⊢ Ⅎ𝑟(𝑋𝐻𝑌)
24	22, 23	ssrmof 3981	. . 3 ⊢ ((𝑋(Iso‘𝐷)𝑌) ⊆ (𝑋𝐻𝑌) → (∃*𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) → ∃*𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
25	18, 21, 24	sylc 66	. 2 ⊢ (𝜑 → ∃*𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
26		reu5 3371	. 2 ⊢ (∃!𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ (∃𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ∧ ∃*𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
27	15, 25, 26	sylanbrc 595	1 ⊢ (𝜑 → ∃!𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∃!wreu 3367  ∃*wrmo 3368   ⊆ wss 3900  ⟨cop 4840   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Hom chom 17483  compcco 17484  Isociso 17971   ≃_𝑐 ccic 18020   Func cfunc 18079

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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  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-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-supp 8215  df-map 8887  df-ixp 8964  df-cat 17892  df-cid 17893  df-sect 17972  df-inv 17973  df-iso 17974  df-cic 18021  df-func 18083

This theorem is used by:  upeu3  50642