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

Theorem uptr2a 50020
Description: Universal property and fully faithful functor surjective on objects. (Contributed by Zhi Wang, 25-Nov-2025.)
Hypotheses
Ref Expression
uptr2a.a 𝐴 = (Base‘𝐶)
uptr2a.b 𝐵 = (Base‘𝐷)
uptr2a.y (𝜑𝑌 = ((1st𝐾)‘𝑋))
uptr2a.f (𝜑 → (𝐺func 𝐾) = 𝐹)
uptr2a.x (𝜑𝑋𝐴)
uptr2a.g (𝜑𝐺 ∈ (𝐷 Func 𝐸))
uptr2a.k (𝜑𝐾 ∈ ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)))
uptr2a.1 (𝜑 → (1st𝐾):𝐴onto𝐵)
Assertion
Ref Expression
uptr2a (𝜑 → (𝑋(𝐹(𝐶 UP 𝐸)𝑍)𝑀𝑌(𝐺(𝐷 UP 𝐸)𝑍)𝑀))

Proof of Theorem uptr2a
StepHypRef Expression
1 uptr2a.a . . 3 𝐴 = (Base‘𝐶)
2 uptr2a.b . . 3 𝐵 = (Base‘𝐷)
3 uptr2a.y . . 3 (𝜑𝑌 = ((1st𝐾)‘𝑋))
4 uptr2a.1 . . 3 (𝜑 → (1st𝐾):𝐴onto𝐵)
5 relfull 17962 . . . . 5 Rel (𝐶 Full 𝐷)
6 relin1 5799 . . . . 5 (Rel (𝐶 Full 𝐷) → Rel ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)))
75, 6ax-mp 5 . . . 4 Rel ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))
8 uptr2a.k . . . 4 (𝜑𝐾 ∈ ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)))
9 1st2ndbr 8035 . . . 4 ((Rel ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)) ∧ 𝐾 ∈ ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))) → (1st𝐾)((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))(2nd𝐾))
107, 8, 9sylancr 598 . . 3 (𝜑 → (1st𝐾)((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))(2nd𝐾))
11 uptr2a.f . . . 4 (𝜑 → (𝐺func 𝐾) = 𝐹)
12 inss1 4189 . . . . . . 7 ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)) ⊆ (𝐶 Full 𝐷)
13 fullfunc 17960 . . . . . . 7 (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)
1412, 13sstri 3946 . . . . . 6 ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)) ⊆ (𝐶 Func 𝐷)
1514, 8sselid 3935 . . . . 5 (𝜑𝐾 ∈ (𝐶 Func 𝐷))
16 uptr2a.g . . . . 5 (𝜑𝐺 ∈ (𝐷 Func 𝐸))
1715, 16cofu1st2nd 49890 . . . 4 (𝜑 → (𝐺func 𝐾) = (⟨(1st𝐺), (2nd𝐺)⟩ ∘func ⟨(1st𝐾), (2nd𝐾)⟩))
18 relfunc 17914 . . . . 5 Rel (𝐶 Func 𝐸)
1915, 16cofucl 17940 . . . . . 6 (𝜑 → (𝐺func 𝐾) ∈ (𝐶 Func 𝐸))
2011, 19eqeltrrd 2864 . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐸))
21 1st2nd 8032 . . . . 5 ((Rel (𝐶 Func 𝐸) ∧ 𝐹 ∈ (𝐶 Func 𝐸)) → 𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
2218, 20, 21sylancr 598 . . . 4 (𝜑𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
2311, 17, 223eqtr3d 2806 . . 3 (𝜑 → (⟨(1st𝐺), (2nd𝐺)⟩ ∘func ⟨(1st𝐾), (2nd𝐾)⟩) = ⟨(1st𝐹), (2nd𝐹)⟩)
24 uptr2a.x . . 3 (𝜑𝑋𝐴)
2516func1st2nd 49874 . . 3 (𝜑 → (1st𝐺)(𝐷 Func 𝐸)(2nd𝐺))
261, 2, 3, 4, 10, 23, 24, 25uptr2 50019 . 2 (𝜑 → (𝑋(⟨(1st𝐹), (2nd𝐹)⟩(𝐶 UP 𝐸)𝑍)𝑀𝑌(⟨(1st𝐺), (2nd𝐺)⟩(𝐷 UP 𝐸)𝑍)𝑀))
2720up1st2ndb 49985 . 2 (𝜑 → (𝑋(𝐹(𝐶 UP 𝐸)𝑍)𝑀𝑋(⟨(1st𝐹), (2nd𝐹)⟩(𝐶 UP 𝐸)𝑍)𝑀))
2816up1st2ndb 49985 . 2 (𝜑 → (𝑌(𝐺(𝐷 UP 𝐸)𝑍)𝑀𝑌(⟨(1st𝐺), (2nd𝐺)⟩(𝐷 UP 𝐸)𝑍)𝑀))
2926, 27, 283bitr4d 314 1 (𝜑 → (𝑋(𝐹(𝐶 UP 𝐸)𝑍)𝑀𝑌(𝐺(𝐷 UP 𝐸)𝑍)𝑀))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1570  wcel 2143  cin 3904  cop 4595   class class class wbr 5109  Rel wrel 5666  ontowfo 6534  cfv 6536  (class class class)co 7410  1st c1st 7980  2nd c2nd 7981  Basecbs 17264   Func cfunc 17906  func ccofu 17908   Full cful 17956   Faith cfth 17957   UP cup 49971
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-map 8822  df-ixp 8892  df-cat 17719  df-cid 17720  df-func 17910  df-cofu 17912  df-full 17958  df-fth 17959  df-up 49972
This theorem is referenced by:  lmdran  50469  cmdlan  50470
  Copyright terms: Public domain W3C validator