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 49919
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 17967 . . . . 5 Rel (𝐶 Full 𝐷)
6 relin1 5800 . . . . 5 (Rel (𝐶 Full 𝐷) → Rel ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)))
75, 6ax-mp 5 . . . 4 Rel ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))
8 uptr2a.k . . . 4 (𝜑𝐾 ∈ ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)))
9 1st2ndbr 8039 . . . 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 4197 . . . . . . 7 ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)) ⊆ (𝐶 Full 𝐷)
13 fullfunc 17965 . . . . . . 7 (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)
1412, 13sstri 3954 . . . . . 6 ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)) ⊆ (𝐶 Func 𝐷)
1514, 8sselid 3943 . . . . 5 (𝜑𝐾 ∈ (𝐶 Func 𝐷))
16 uptr2a.g . . . . 5 (𝜑𝐺 ∈ (𝐷 Func 𝐸))
1715, 16cofu1st2nd 49789 . . . 4 (𝜑 → (𝐺func 𝐾) = (⟨(1st𝐺), (2nd𝐺)⟩ ∘func ⟨(1st𝐾), (2nd𝐾)⟩))
18 relfunc 17919 . . . . 5 Rel (𝐶 Func 𝐸)
1915, 16cofucl 17945 . . . . . 6 (𝜑 → (𝐺func 𝐾) ∈ (𝐶 Func 𝐸))
2011, 19eqeltrrd 2870 . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐸))
21 1st2nd 8036 . . . . 5 ((Rel (𝐶 Func 𝐸) ∧ 𝐹 ∈ (𝐶 Func 𝐸)) → 𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
2218, 20, 21sylancr 598 . . . 4 (𝜑𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
2311, 17, 223eqtr3d 2812 . . 3 (𝜑 → (⟨(1st𝐺), (2nd𝐺)⟩ ∘func ⟨(1st𝐾), (2nd𝐾)⟩) = ⟨(1st𝐹), (2nd𝐹)⟩)
24 uptr2a.x . . 3 (𝜑𝑋𝐴)
2516func1st2nd 49773 . . 3 (𝜑 → (1st𝐺)(𝐷 Func 𝐸)(2nd𝐺))
261, 2, 3, 4, 10, 23, 24, 25uptr2 49918 . 2 (𝜑 → (𝑋(⟨(1st𝐹), (2nd𝐹)⟩(𝐶 UP 𝐸)𝑍)𝑀𝑌(⟨(1st𝐺), (2nd𝐺)⟩(𝐷 UP 𝐸)𝑍)𝑀))
2720up1st2ndb 49884 . 2 (𝜑 → (𝑋(𝐹(𝐶 UP 𝐸)𝑍)𝑀𝑋(⟨(1st𝐹), (2nd𝐹)⟩(𝐶 UP 𝐸)𝑍)𝑀))
2816up1st2ndb 49884 . 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 1567  wcel 2149  cin 3912  cop 4600   class class class wbr 5113  Rel wrel 5667  ontowfo 6535  cfv 6537  (class class class)co 7411  1st c1st 7984  2nd c2nd 7985  Basecbs 17269   Func cfunc 17911  func ccofu 17913   Full cful 17961   Faith cfth 17962   UP cup 49870
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7986  df-2nd 7987  df-map 8826  df-ixp 8896  df-cat 17724  df-cid 17725  df-func 17915  df-cofu 17917  df-full 17963  df-fth 17964  df-up 49871
This theorem is referenced by:  lmdran  50368  cmdlan  50369
  Copyright terms: Public domain W3C validator