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

Theorem uptrar 49846
Description: Universal property and fully faithful functor. (Contributed by Zhi Wang, 17-Nov-2025.)
Hypotheses
Ref Expression
uptra.y (𝜑 → ((1st𝐾)‘𝑋) = 𝑌)
uptra.k (𝜑𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
uptra.g (𝜑 → (𝐾func 𝐹) = 𝐺)
uptra.b 𝐵 = (Base‘𝐷)
uptra.x (𝜑𝑋𝐵)
uptra.f (𝜑𝐹 ∈ (𝐶 Func 𝐷))
uptrar.m (𝜑 → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) = 𝑀)
uptrar.z (𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁)
Assertion
Ref Expression
uptrar (𝜑𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀)

Proof of Theorem uptrar
StepHypRef Expression
1 uptrar.z . 2 (𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁)
2 uptra.y . . . . 5 (𝜑 → ((1st𝐾)‘𝑋) = 𝑌)
32adantr 485 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st𝐾)‘𝑋) = 𝑌)
4 uptra.k . . . . 5 (𝜑𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
54adantr 485 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
6 uptra.g . . . . 5 (𝜑 → (𝐾func 𝐹) = 𝐺)
76adantr 485 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝐾func 𝐹) = 𝐺)
8 uptra.b . . . 4 𝐵 = (Base‘𝐷)
9 uptra.x . . . . 5 (𝜑𝑋𝐵)
109adantr 485 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑋𝐵)
11 uptra.f . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
1211adantr 485 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐹 ∈ (𝐶 Func 𝐷))
13 uptrar.m . . . . . . 7 (𝜑 → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) = 𝑀)
1413adantr 485 . . . . . 6 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) = 𝑀)
1514fveq2d 6875 . . . . 5 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁)) = ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑀))
16 eqid 2765 . . . . . . . 8 (Hom ‘𝐷) = (Hom ‘𝐷)
17 eqid 2765 . . . . . . . 8 (Hom ‘𝐸) = (Hom ‘𝐸)
18 relfull 17955 . . . . . . . . . . 11 Rel (𝐷 Full 𝐸)
19 relin1 5789 . . . . . . . . . . 11 (Rel (𝐷 Full 𝐸) → Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
2018, 19ax-mp 5 . . . . . . . . . 10 Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))
21 1st2ndbr 8027 . . . . . . . . . 10 ((Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ∧ 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))) → (1st𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd𝐾))
2220, 4, 21sylancr 598 . . . . . . . . 9 (𝜑 → (1st𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd𝐾))
2322adantr 485 . . . . . . . 8 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd𝐾))
24 eqid 2765 . . . . . . . . . 10 (Base‘𝐶) = (Base‘𝐶)
2512func1st2nd 49706 . . . . . . . . . 10 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
2624, 8, 25funcf1 17911 . . . . . . . . 9 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st𝐹):(Base‘𝐶)⟶𝐵)
27 simpr 489 . . . . . . . . . . 11 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁)
2827up1st2nd 49815 . . . . . . . . . 10 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍(⟨(1st𝐺), (2nd𝐺)⟩(𝐶 UP 𝐸)𝑌)𝑁)
2928, 24uprcl4 49821 . . . . . . . . 9 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍 ∈ (Base‘𝐶))
3026, 29ffvelcdmd 7070 . . . . . . . 8 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st𝐹)‘𝑍) ∈ 𝐵)
318, 16, 17, 23, 10, 30ffthf1o 17966 . . . . . . 7 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(((1st𝐾)‘𝑋)(Hom ‘𝐸)((1st𝐾)‘((1st𝐹)‘𝑍))))
32 inss1 4191 . . . . . . . . . . . . . 14 ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ⊆ (𝐷 Full 𝐸)
33 fullfunc 17953 . . . . . . . . . . . . . 14 (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
3432, 33sstri 3948 . . . . . . . . . . . . 13 ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ⊆ (𝐷 Func 𝐸)
3534, 4sselid 3937 . . . . . . . . . . . 12 (𝜑𝐾 ∈ (𝐷 Func 𝐸))
3635adantr 485 . . . . . . . . . . 11 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐾 ∈ (𝐷 Func 𝐸))
3724, 12, 36, 29cofu1 17929 . . . . . . . . . 10 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘(𝐾func 𝐹))‘𝑍) = ((1st𝐾)‘((1st𝐹)‘𝑍)))
387fveq2d 6875 . . . . . . . . . . 11 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st ‘(𝐾func 𝐹)) = (1st𝐺))
3938fveq1d 6873 . . . . . . . . . 10 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘(𝐾func 𝐹))‘𝑍) = ((1st𝐺)‘𝑍))
4037, 39eqtr3d 2802 . . . . . . . . 9 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st𝐾)‘((1st𝐹)‘𝑍)) = ((1st𝐺)‘𝑍))
413, 40oveq12d 7418 . . . . . . . 8 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (((1st𝐾)‘𝑋)(Hom ‘𝐸)((1st𝐾)‘((1st𝐹)‘𝑍))) = (𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)))
4241f1oeq3d 6807 . . . . . . 7 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(((1st𝐾)‘𝑋)(Hom ‘𝐸)((1st𝐾)‘((1st𝐹)‘𝑍))) ↔ (𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍))))
4331, 42mpbid 235 . . . . . 6 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)))
4428, 17uprcl5 49822 . . . . . 6 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)))
45 f1ocnvfv2 7265 . . . . . 6 (((𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)) ∧ 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍))) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁)) = 𝑁)
4643, 44, 45syl2anc 595 . . . . 5 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁)) = 𝑁)
4715, 46eqtr3d 2802 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑀) = 𝑁)
48 f1ocnvdm 7273 . . . . . 6 (((𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)) ∧ 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍))) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) ∈ (𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍)))
4943, 44, 48syl2anc 595 . . . . 5 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) ∈ (𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍)))
5014, 49eqeltrrd 2866 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑀 ∈ (𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍)))
513, 5, 7, 8, 10, 12, 47, 16, 50uptra 49845 . . 3 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁))
521, 51mpdan 699 . 2 (𝜑 → (𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁))
531, 52mpbird 260 1 (𝜑𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1563  wcel 2145  cin 3906   class class class wbr 5104  ccnv 5650  Rel wrel 5656  1-1-ontowf1o 6524  cfv 6525  (class class class)co 7400  1st c1st 7972  2nd c2nd 7973  Basecbs 17257  Hom chom 17309   Func cfunc 17899  func ccofu 17901   Full cful 17949   Faith cfth 17950   UP cup 49803
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-map 8814  df-ixp 8884  df-cat 17712  df-cid 17713  df-func 17903  df-cofu 17905  df-full 17951  df-fth 17952  df-up 49804
This theorem is referenced by:  uobffth  49848
  Copyright terms: Public domain W3C validator