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 49409
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 17832 . . . . 5 Rel (𝐶 Full 𝐷)
6 relin1 5759 . . . . 5 (Rel (𝐶 Full 𝐷) → Rel ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)))
75, 6ax-mp 5 . . . 4 Rel ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))
8 uptr2a.k . . . 4 (𝜑𝐾 ∈ ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)))
9 1st2ndbr 7984 . . . 4 ((Rel ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)) ∧ 𝐾 ∈ ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))) → (1st𝐾)((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))(2nd𝐾))
107, 8, 9sylancr 587 . . 3 (𝜑 → (1st𝐾)((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))(2nd𝐾))
11 uptr2a.f . . . 4 (𝜑 → (𝐺func 𝐾) = 𝐹)
12 inss1 4187 . . . . . . 7 ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)) ⊆ (𝐶 Full 𝐷)
13 fullfunc 17830 . . . . . . 7 (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)
1412, 13sstri 3941 . . . . . 6 ((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷)) ⊆ (𝐶 Func 𝐷)
1514, 8sselid 3929 . . . . 5 (𝜑𝐾 ∈ (𝐶 Func 𝐷))
16 uptr2a.g . . . . 5 (𝜑𝐺 ∈ (𝐷 Func 𝐸))
1715, 16cofu1st2nd 49279 . . . 4 (𝜑 → (𝐺func 𝐾) = (⟨(1st𝐺), (2nd𝐺)⟩ ∘func ⟨(1st𝐾), (2nd𝐾)⟩))
18 relfunc 17784 . . . . 5 Rel (𝐶 Func 𝐸)
1915, 16cofucl 17810 . . . . . 6 (𝜑 → (𝐺func 𝐾) ∈ (𝐶 Func 𝐸))
2011, 19eqeltrrd 2835 . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐸))
21 1st2nd 7981 . . . . 5 ((Rel (𝐶 Func 𝐸) ∧ 𝐹 ∈ (𝐶 Func 𝐸)) → 𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
2218, 20, 21sylancr 587 . . . 4 (𝜑𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
2311, 17, 223eqtr3d 2777 . . 3 (𝜑 → (⟨(1st𝐺), (2nd𝐺)⟩ ∘func ⟨(1st𝐾), (2nd𝐾)⟩) = ⟨(1st𝐹), (2nd𝐹)⟩)
24 uptr2a.x . . 3 (𝜑𝑋𝐴)
2516func1st2nd 49263 . . 3 (𝜑 → (1st𝐺)(𝐷 Func 𝐸)(2nd𝐺))
261, 2, 3, 4, 10, 23, 24, 25uptr2 49408 . 2 (𝜑 → (𝑋(⟨(1st𝐹), (2nd𝐹)⟩(𝐶 UP 𝐸)𝑍)𝑀𝑌(⟨(1st𝐺), (2nd𝐺)⟩(𝐷 UP 𝐸)𝑍)𝑀))
2720up1st2ndb 49374 . 2 (𝜑 → (𝑋(𝐹(𝐶 UP 𝐸)𝑍)𝑀𝑋(⟨(1st𝐹), (2nd𝐹)⟩(𝐶 UP 𝐸)𝑍)𝑀))
2816up1st2ndb 49374 . 2 (𝜑 → (𝑌(𝐺(𝐷 UP 𝐸)𝑍)𝑀𝑌(⟨(1st𝐺), (2nd𝐺)⟩(𝐷 UP 𝐸)𝑍)𝑀))
2926, 27, 283bitr4d 311 1 (𝜑 → (𝑋(𝐹(𝐶 UP 𝐸)𝑍)𝑀𝑌(𝐺(𝐷 UP 𝐸)𝑍)𝑀))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1541  wcel 2113  cin 3898  cop 4584   class class class wbr 5096  Rel wrel 5627  ontowfo 6488  cfv 6490  (class class class)co 7356  1st c1st 7929  2nd c2nd 7930  Basecbs 17134   Func cfunc 17776  func ccofu 17778   Full cful 17826   Faith cfth 17827   UP cup 49360
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-map 8763  df-ixp 8834  df-cat 17589  df-cid 17590  df-func 17780  df-cofu 17782  df-full 17828  df-fth 17829  df-up 49361
This theorem is referenced by:  lmdran  49858  cmdlan  49859
  Copyright terms: Public domain W3C validator