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 49691
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 480 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st𝐾)‘𝑋) = 𝑌)
4 uptra.k . . . . 5 (𝜑𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
54adantr 480 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
6 uptra.g . . . . 5 (𝜑 → (𝐾func 𝐹) = 𝐺)
76adantr 480 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝐾func 𝐹) = 𝐺)
8 uptra.b . . . 4 𝐵 = (Base‘𝐷)
9 uptra.x . . . . 5 (𝜑𝑋𝐵)
109adantr 480 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑋𝐵)
11 uptra.f . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
1211adantr 480 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐹 ∈ (𝐶 Func 𝐷))
13 uptrar.m . . . . . . 7 (𝜑 → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) = 𝑀)
1413adantr 480 . . . . . 6 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) = 𝑀)
1514fveq2d 6844 . . . . 5 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁)) = ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑀))
16 eqid 2736 . . . . . . . 8 (Hom ‘𝐷) = (Hom ‘𝐷)
17 eqid 2736 . . . . . . . 8 (Hom ‘𝐸) = (Hom ‘𝐸)
18 relfull 17877 . . . . . . . . . . 11 Rel (𝐷 Full 𝐸)
19 relin1 5768 . . . . . . . . . . 11 (Rel (𝐷 Full 𝐸) → Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
2018, 19ax-mp 5 . . . . . . . . . 10 Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))
21 1st2ndbr 7995 . . . . . . . . . 10 ((Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ∧ 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))) → (1st𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd𝐾))
2220, 4, 21sylancr 588 . . . . . . . . 9 (𝜑 → (1st𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd𝐾))
2322adantr 480 . . . . . . . 8 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd𝐾))
24 eqid 2736 . . . . . . . . . 10 (Base‘𝐶) = (Base‘𝐶)
2512func1st2nd 49551 . . . . . . . . . 10 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
2624, 8, 25funcf1 17833 . . . . . . . . 9 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st𝐹):(Base‘𝐶)⟶𝐵)
27 simpr 484 . . . . . . . . . . 11 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁)
2827up1st2nd 49660 . . . . . . . . . 10 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍(⟨(1st𝐺), (2nd𝐺)⟩(𝐶 UP 𝐸)𝑌)𝑁)
2928, 24uprcl4 49666 . . . . . . . . 9 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍 ∈ (Base‘𝐶))
3026, 29ffvelcdmd 7037 . . . . . . . 8 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st𝐹)‘𝑍) ∈ 𝐵)
318, 16, 17, 23, 10, 30ffthf1o 17888 . . . . . . 7 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(((1st𝐾)‘𝑋)(Hom ‘𝐸)((1st𝐾)‘((1st𝐹)‘𝑍))))
32 inss1 4177 . . . . . . . . . . . . . 14 ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ⊆ (𝐷 Full 𝐸)
33 fullfunc 17875 . . . . . . . . . . . . . 14 (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
3432, 33sstri 3931 . . . . . . . . . . . . 13 ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ⊆ (𝐷 Func 𝐸)
3534, 4sselid 3919 . . . . . . . . . . . 12 (𝜑𝐾 ∈ (𝐷 Func 𝐸))
3635adantr 480 . . . . . . . . . . 11 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐾 ∈ (𝐷 Func 𝐸))
3724, 12, 36, 29cofu1 17851 . . . . . . . . . 10 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘(𝐾func 𝐹))‘𝑍) = ((1st𝐾)‘((1st𝐹)‘𝑍)))
387fveq2d 6844 . . . . . . . . . . 11 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st ‘(𝐾func 𝐹)) = (1st𝐺))
3938fveq1d 6842 . . . . . . . . . 10 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘(𝐾func 𝐹))‘𝑍) = ((1st𝐺)‘𝑍))
4037, 39eqtr3d 2773 . . . . . . . . 9 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st𝐾)‘((1st𝐹)‘𝑍)) = ((1st𝐺)‘𝑍))
413, 40oveq12d 7385 . . . . . . . 8 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (((1st𝐾)‘𝑋)(Hom ‘𝐸)((1st𝐾)‘((1st𝐹)‘𝑍))) = (𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)))
4241f1oeq3d 6777 . . . . . . 7 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(((1st𝐾)‘𝑋)(Hom ‘𝐸)((1st𝐾)‘((1st𝐹)‘𝑍))) ↔ (𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍))))
4331, 42mpbid 232 . . . . . 6 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)))
4428, 17uprcl5 49667 . . . . . 6 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)))
45 f1ocnvfv2 7232 . . . . . 6 (((𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)) ∧ 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍))) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁)) = 𝑁)
4643, 44, 45syl2anc 585 . . . . 5 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁)) = 𝑁)
4715, 46eqtr3d 2773 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑀) = 𝑁)
48 f1ocnvdm 7240 . . . . . 6 (((𝑋(2nd𝐾)((1st𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍)) ∧ 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st𝐺)‘𝑍))) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) ∈ (𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍)))
4943, 44, 48syl2anc 585 . . . . 5 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd𝐾)((1st𝐹)‘𝑍))‘𝑁) ∈ (𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍)))
5014, 49eqeltrrd 2837 . . . 4 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑀 ∈ (𝑋(Hom ‘𝐷)((1st𝐹)‘𝑍)))
513, 5, 7, 8, 10, 12, 47, 16, 50uptra 49690 . . 3 ((𝜑𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁))
521, 51mpdan 688 . 2 (𝜑 → (𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁))
531, 52mpbird 257 1 (𝜑𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  cin 3888   class class class wbr 5085  ccnv 5630  Rel wrel 5636  1-1-ontowf1o 6497  cfv 6498  (class class class)co 7367  1st c1st 7940  2nd c2nd 7941  Basecbs 17179  Hom chom 17231   Func cfunc 17821  func ccofu 17823   Full cful 17871   Faith cfth 17872   UP cup 49648
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-map 8775  df-ixp 8846  df-cat 17634  df-cid 17635  df-func 17825  df-cofu 17827  df-full 17873  df-fth 17874  df-up 49649
This theorem is referenced by:  uobffth  49693
  Copyright terms: Public domain W3C validator