uptrai - Mathbox for Zhi Wang

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

Theorem uptrai 50036

Description: Universal property and fully faithful functor. (Contributed by Zhi Wang, 16-Nov-2025.)

**Hypotheses**
Ref	Expression
uptra.y	⊢ (𝜑 → ((1^st ‘𝐾)‘𝑋) = 𝑌)
uptra.k	⊢ (𝜑 → 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
uptra.g	⊢ (𝜑 → (𝐾 ∘_func 𝐹) = 𝐺)
uptrai.n	⊢ (𝜑 → ((𝑋(2^nd ‘𝐾)((1^st ‘𝐹)‘𝑍))‘𝑀) = 𝑁)
uptrai.z	⊢ (𝜑 → 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀)

**Assertion**
Ref	Expression
uptrai	⊢ (𝜑 → 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁)

**Proof of Theorem uptrai**
Step	Hyp	Ref	Expression
1		uptrai.z	. 2 ⊢ (𝜑 → 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀)
2		uptra.y	. . . . 5 ⊢ (𝜑 → ((1^st ‘𝐾)‘𝑋) = 𝑌)
3	2	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀) → ((1^st ‘𝐾)‘𝑋) = 𝑌)
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		eqid 2766	. . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷)
9		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀) → 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀)
10	9	up1st2nd 50004	. . . . 5 ⊢ ((𝜑 ∧ 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀) → 𝑍(⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩(𝐶 UP 𝐷)𝑋)𝑀)
11	10, 8	uprcl3 50009	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀) → 𝑋 ∈ (Base‘𝐷))
12	9	uprcl2a 50022	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀) → 𝐹 ∈ (𝐶 Func 𝐷))
13		uptrai.n	. . . . 5 ⊢ (𝜑 → ((𝑋(2^nd ‘𝐾)((1^st ‘𝐹)‘𝑍))‘𝑀) = 𝑁)
14	13	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀) → ((𝑋(2^nd ‘𝐾)((1^st ‘𝐹)‘𝑍))‘𝑀) = 𝑁)
15		eqid 2766	. . . 4 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
16	10, 15	uprcl5 50011	. . . 4 ⊢ ((𝜑 ∧ 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀) → 𝑀 ∈ (𝑋(Hom ‘𝐷)((1^st ‘𝐹)‘𝑍)))
17	3, 5, 7, 8, 11, 12, 14, 15, 16	uptra 50034	. . 3 ⊢ ((𝜑 ∧ 𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀) → (𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀 ↔ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁))
18	1, 17	mpdan 700	. 2 ⊢ (𝜑 → (𝑍(𝐹(𝐶 UP 𝐷)𝑋)𝑀 ↔ 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁))
19	1, 18	mpbid 235	1 ⊢ (𝜑 → 𝑍(𝐺(𝐶 UP 𝐸)𝑌)𝑁)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∩ cin 3907 class class class wbr 5114 ‘cfv 6543 (class class class)co 7423 1^st c1st 7993 2^nd c2nd 7994 Basecbs 17294 Hom chom 17346 ∘_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 uobeqw 50038

W3C validator