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

Theorem upeu 49661
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
StepHypRef 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 (𝜑 → ∀𝑣𝐵𝑔 ∈ (𝑍𝐽(𝐹𝑣))∃!𝑙 ∈ (𝑌𝐻𝑣)𝑔 = (((𝑌𝐺𝑣)‘𝑙)(⟨𝑍, (𝐹𝑌)⟩𝑂(𝐹𝑣))𝑁))
141, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13upciclem4 49659 . . 3 (𝜑 → (𝑋( ≃𝑐𝐷)𝑌 ∧ ∃𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀)))
1514simprd 496 . 2 (𝜑 → ∃𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀))
16 eqid 2739 . . . 4 (Iso‘𝐷) = (Iso‘𝐷)
176funcrcl2 49569 . . . 4 (𝜑𝐷 ∈ Cat)
181, 3, 16, 17, 7, 8isohom 17734 . . 3 (𝜑 → (𝑋(Iso‘𝐷)𝑌) ⊆ (𝑋𝐻𝑌))
1911, 8, 12upciclem1 49656 . . . 4 (𝜑 → ∃!𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀))
20 reurmo 3347 . . . 4 (∃!𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀) → ∃*𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀))
2119, 20syl 17 . . 3 (𝜑 → ∃*𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀))
22 nfcv 2901 . . . 4 𝑟(𝑋(Iso‘𝐷)𝑌)
23 nfcv 2901 . . . 4 𝑟(𝑋𝐻𝑌)
2422, 23ssrmof 3982 . . 3 ((𝑋(Iso‘𝐷)𝑌) ⊆ (𝑋𝐻𝑌) → (∃*𝑟 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀) → ∃*𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀)))
2518, 21, 24sylc 65 . 2 (𝜑 → ∃*𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀))
26 reu5 3346 . 2 (∃!𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀) ↔ (∃𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀) ∧ ∃*𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀)))
2715, 25, 26sylanbrc 589 1 (𝜑 → ∃!𝑟 ∈ (𝑋(Iso‘𝐷)𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑟)(⟨𝑍, (𝐹𝑋)⟩𝑂(𝐹𝑌))𝑀))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  wral 3053  wrex 3063  ∃!wreu 3342  ∃*wrmo 3343  wss 3883  cop 4561   class class class wbr 5072  cfv 6485  (class class class)co 7356  Basecbs 17170  Hom chom 17222  compcco 17223  Isociso 17704  𝑐 ccic 17753   Func cfunc 17812
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-supp 8101  df-map 8765  df-ixp 8836  df-cat 17625  df-cid 17626  df-sect 17705  df-inv 17706  df-iso 17707  df-cic 17754  df-func 17816
This theorem is referenced by:  upeu3  49685
  Copyright terms: Public domain W3C validator