Theorem uptrar 50035

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

Step	Hyp	Ref	Expression
1		uptrar.z	. 2 ⊢ (𝜑 → 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁)
2		uptra.y	. . . . 5 ⊢ (𝜑 → ((1st ‘𝐾)‘𝑋) = 𝑌)
3	2	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘𝐾)‘𝑋) = 𝑌)
4		uptra.k	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
5	4	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
6		uptra.g	. . . . 5 ⊢ (𝜑 → (𝐾 ∘func 𝐹) = 𝐺)
7	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝐾 ∘func 𝐹) = 𝐺)
8		uptra.b	. . . 4 ⊢ 𝐵 = (Base‘𝐷)
9		uptra.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
10	9	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑋 ∈ 𝐵)
11		uptra.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
12	11	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐹 ∈ (𝐶 Func 𝐷))
13		uptrar.m	. . . . . . 7 ⊢ (𝜑 → (◡(𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑁) = 𝑀)
14	13	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (◡(𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑁) = 𝑀)
15	14	fveq2d 6892	. . . . 5 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘(◡(𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑁)) = ((𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑀))
16		eqid 2766	. . . . . . . 8 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
17		eqid 2766	. . . . . . . 8 ⊢ (Hom ‘𝐸) = (Hom ‘𝐸)
18		relfull 17992	. . . . . . . . . . 11 ⊢ Rel (𝐷 Full 𝐸)
19		relin1 5804	. . . . . . . . . . 11 ⊢ (Rel (𝐷 Full 𝐸) → Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
20	18, 19	ax-mp 5	. . . . . . . . . 10 ⊢ Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))
21		1st2ndbr 8048	. . . . . . . . . 10 ⊢ ((Rel ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ∧ 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))) → (1st ‘𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd ‘𝐾))
22	20, 4, 21	sylancr 599	. . . . . . . . 9 ⊢ (𝜑 → (1st ‘𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd ‘𝐾))
23	22	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st ‘𝐾)((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸))(2nd ‘𝐾))
24		eqid 2766	. . . . . . . . . 10 ⊢ (Base‘𝐶) = (Base‘𝐶)
25	12	func1st2nd 49895	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
26	24, 8, 25	funcf1 17948	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st ‘𝐹):(Base‘𝐶)⟶𝐵)
27		simpr 490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁)
28	27	up1st2nd 50004	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍(⟨(1st ‘𝐺), (2nd ‘𝐺)⟩(𝐶 UP 𝐸)𝑌)𝑁)
29	28, 24	uprcl4 50010	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑍 ∈ (Base‘𝐶))
30	26, 29	ffvelcdmd 7087	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘𝐹)‘𝑍) ∈ 𝐵)
31	8, 16, 17, 23, 10, 30	ffthf1o 18003	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍))–1-1-onto→(((1st ‘𝐾)‘𝑋)(Hom ‘𝐸)((1st ‘𝐾)‘((1st ‘𝐹)‘𝑍))))
32		inss1 4192	. . . . . . . . . . . . . 14 ⊢ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ⊆ (𝐷 Full 𝐸)
33		fullfunc 17990	. . . . . . . . . . . . . 14 ⊢ (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
34	32, 33	sstri 3949	. . . . . . . . . . . . 13 ⊢ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)) ⊆ (𝐷 Func 𝐸)
35	34, 4	sselid 3938	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐾 ∈ (𝐷 Func 𝐸))
36	35	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝐾 ∈ (𝐷 Func 𝐸))
37	24, 12, 36, 29	cofu1 17966	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘(𝐾 ∘func 𝐹))‘𝑍) = ((1st ‘𝐾)‘((1st ‘𝐹)‘𝑍)))
38	7	fveq2d 6892	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (1st ‘(𝐾 ∘func 𝐹)) = (1st ‘𝐺))
39	38	fveq1d 6890	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘(𝐾 ∘func 𝐹))‘𝑍) = ((1st ‘𝐺)‘𝑍))
40	37, 39	eqtr3d 2803	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((1st ‘𝐾)‘((1st ‘𝐹)‘𝑍)) = ((1st ‘𝐺)‘𝑍))
41	3, 40	oveq12d 7441	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (((1st ‘𝐾)‘𝑋)(Hom ‘𝐸)((1st ‘𝐾)‘((1st ‘𝐹)‘𝑍))) = (𝑌(Hom ‘𝐸)((1st ‘𝐺)‘𝑍)))
42	41	f1oeq3d 6824	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍))–1-1-onto→(((1st ‘𝐾)‘𝑋)(Hom ‘𝐸)((1st ‘𝐾)‘((1st ‘𝐹)‘𝑍))) ↔ (𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st ‘𝐺)‘𝑍))))
43	31, 42	mpbid 235	. . . . . 6 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st ‘𝐺)‘𝑍)))
44	28, 17	uprcl5 50011	. . . . . 6 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st ‘𝐺)‘𝑍)))
45		f1ocnvfv2 7286	. . . . . 6 ⊢ (((𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st ‘𝐺)‘𝑍)) ∧ 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st ‘𝐺)‘𝑍))) → ((𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘(◡(𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑁)) = 𝑁)
46	43, 44, 45	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘(◡(𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑁)) = 𝑁)
47	15, 46	eqtr3d 2803	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → ((𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑀) = 𝑁)
48		f1ocnvdm 7294	. . . . . 6 ⊢ (((𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍)):(𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍))–1-1-onto→(𝑌(Hom ‘𝐸)((1st ‘𝐺)‘𝑍)) ∧ 𝑁 ∈ (𝑌(Hom ‘𝐸)((1st ‘𝐺)‘𝑍))) → (◡(𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑁) ∈ (𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍)))
49	43, 44, 48	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (◡(𝑋(2nd ‘𝐾)((1st ‘𝐹)‘𝑍))‘𝑁) ∈ (𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍)))
50	14, 49	eqeltrrd 2867	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → 𝑀 ∈ (𝑋(Hom ‘𝐷)((1st ‘𝐹)‘𝑍)))
51	3, 5, 7, 8, 10, 12, 47, 16, 50	uptra 50034	. . 3 ⊢ ((𝜑 ∧ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁) → (𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀 ↔ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁))
52	1, 51	mpdan 700	. 2 ⊢ (𝜑 → (𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀 ↔ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁))
53	1, 52	mpbird 260	1 ⊢ (𝜑 → 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ∩ cin 3907   class class class wbr 5114  ^◡ccnv 5665  Rel wrel 5671  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7423  1^st c1st 7993  2^nd c2nd 7994  Basecbs 17294  Hom chom 17346   Func cfunc 17936   ∘_func ccofu 17938   Full cful 17986   Faith cfth 17987   UP cup 49992

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-map 8835  df-ixp 8905  df-cat 17749  df-cid 17750  df-func 17940  df-cofu 17942  df-full 17988  df-fth 17989  df-up 49993

This theorem is used by:  uobffth  50037