Theorem uppropd 49342

Description: If two categories have the same set of objects, morphisms, and compositions, then they have the same universal pairs. (Contributed by Zhi Wang, 20-Nov-2025.)

Hypotheses

Ref	Expression
uppropd.1	⊢ (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
uppropd.2	⊢ (𝜑 → (compf‘𝐴) = (compf‘𝐵))
uppropd.3	⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
uppropd.4	⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))
uppropd.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
uppropd.b	⊢ (𝜑 → 𝐵 ∈ 𝑉)
uppropd.c	⊢ (𝜑 → 𝐶 ∈ 𝑉)
uppropd.d	⊢ (𝜑 → 𝐷 ∈ 𝑉)

Assertion

Ref	Expression
uppropd	⊢ (𝜑 → (𝐴 UP 𝐶) = (𝐵 UP 𝐷))

Proof of Theorem uppropd

Dummy variables 𝑓 𝑔 𝑘 𝑚 𝑤 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uppropd.1	. . . 4 ⊢ (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
2		uppropd.2	. . . 4 ⊢ (𝜑 → (compf‘𝐴) = (compf‘𝐵))
3		uppropd.3	. . . 4 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
4		uppropd.4	. . . 4 ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))
5		uppropd.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		uppropd.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
7		uppropd.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
8		uppropd.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑉)
9	1, 2, 3, 4, 5, 6, 7, 8	funcpropd 17817	. . 3 ⊢ (𝜑 → (𝐴 Func 𝐶) = (𝐵 Func 𝐷))
10	3	homfeqbas 17610	. . . 4 ⊢ (𝜑 → (Base‘𝐶) = (Base‘𝐷))
11	10	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐴 Func 𝐶)) → (Base‘𝐶) = (Base‘𝐷))
12	1	homfeqbas 17610	. . . . . . . . 9 ⊢ (𝜑 → (Base‘𝐴) = (Base‘𝐵))
13	12	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (Base‘𝐴) = (Base‘𝐵))
14	13	adantr 480	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → (Base‘𝐴) = (Base‘𝐵))
15		eqid 2733	. . . . . . . . 9 ⊢ (Base‘𝐶) = (Base‘𝐶)
16		eqid 2733	. . . . . . . . 9 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
17		eqid 2733	. . . . . . . . 9 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
18	3	ad3antrrr 730	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → (Homf ‘𝐶) = (Homf ‘𝐷))
19		simprr 772	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → 𝑤 ∈ (Base‘𝐶))
20	19	ad2antrr 726	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑤 ∈ (Base‘𝐶))
21		eqid 2733	. . . . . . . . . . . 12 ⊢ (Base‘𝐴) = (Base‘𝐴)
22		simprl 770	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → 𝑓 ∈ (𝐴 Func 𝐶))
23	22	func1st2nd 49237	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (1st ‘𝑓)(𝐴 Func 𝐶)(2nd ‘𝑓))
24	21, 15, 23	funcf1 17781	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (1st ‘𝑓):(Base‘𝐴)⟶(Base‘𝐶))
25	24	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → (1st ‘𝑓):(Base‘𝐴)⟶(Base‘𝐶))
26	25	ffvelcdmda 7026	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → ((1st ‘𝑓)‘𝑦) ∈ (Base‘𝐶))
27	15, 16, 17, 18, 20, 26	homfeqval 17611	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦)) = (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦)))
28		eqid 2733	. . . . . . . . . 10 ⊢ (Hom ‘𝐴) = (Hom ‘𝐴)
29		eqid 2733	. . . . . . . . . 10 ⊢ (Hom ‘𝐵) = (Hom ‘𝐵)
30	1	ad4antr 732	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (Homf ‘𝐴) = (Homf ‘𝐵))
31		simprl 770	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → 𝑥 ∈ (Base‘𝐴))
32	31	ad2antrr 726	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → 𝑥 ∈ (Base‘𝐴))
33		simplr 768	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → 𝑦 ∈ (Base‘𝐴))
34	21, 28, 29, 30, 32, 33	homfeqval 17611	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (𝑥(Hom ‘𝐴)𝑦) = (𝑥(Hom ‘𝐵)𝑦))
35		eqid 2733	. . . . . . . . . . 11 ⊢ (comp‘𝐶) = (comp‘𝐶)
36		eqid 2733	. . . . . . . . . . 11 ⊢ (comp‘𝐷) = (comp‘𝐷)
37	18	ad2antrr 726	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (Homf ‘𝐶) = (Homf ‘𝐷))
38	4	ad5antr 734	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (compf‘𝐶) = (compf‘𝐷))
39	20	ad2antrr 726	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → 𝑤 ∈ (Base‘𝐶))
40	24	ffvelcdmda 7026	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → ((1st ‘𝑓)‘𝑥) ∈ (Base‘𝐶))
41	40	adantrr 717	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → ((1st ‘𝑓)‘𝑥) ∈ (Base‘𝐶))
42	41	ad3antrrr 730	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → ((1st ‘𝑓)‘𝑥) ∈ (Base‘𝐶))
43	26	ad2antrr 726	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → ((1st ‘𝑓)‘𝑦) ∈ (Base‘𝐶))
44		simprr 772	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))
45	44	ad3antrrr 730	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))
46	23	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (1st ‘𝑓)(𝐴 Func 𝐶)(2nd ‘𝑓))
47	21, 28, 16, 46, 32, 33	funcf2 17783	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (𝑥(2nd ‘𝑓)𝑦):(𝑥(Hom ‘𝐴)𝑦)⟶(((1st ‘𝑓)‘𝑥)(Hom ‘𝐶)((1st ‘𝑓)‘𝑦)))
48	47	ffvelcdmda 7026	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → ((𝑥(2nd ‘𝑓)𝑦)‘𝑘) ∈ (((1st ‘𝑓)‘𝑥)(Hom ‘𝐶)((1st ‘𝑓)‘𝑦)))
49	15, 16, 35, 36, 37, 38, 39, 42, 43, 45, 48	comfeqval 17622	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚) = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))
50	49	eqeq2d 2744	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚) ↔ 𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚)))
51	34, 50	reueqbidva 48967	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚)))
52	27, 51	raleqbidva 3299	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → (∀𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚) ↔ ∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚)))
53	14, 52	raleqbidva 3299	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → (∀𝑦 ∈ (Base‘𝐴)∀𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚) ↔ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚)))
54	53	pm5.32da 579	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐴)∀𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚)) ↔ ((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))))
55	3	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → (Homf ‘𝐶) = (Homf ‘𝐷))
56		simplrr 777	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → 𝑤 ∈ (Base‘𝐶))
57	15, 16, 17, 55, 56, 40	homfeqval 17611	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)) = (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥)))
58	57	eleq2d 2819	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → (𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)) ↔ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥))))
59	58	pm5.32da 579	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → ((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ↔ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥)))))
60	13	eleq2d 2819	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (𝑥 ∈ (Base‘𝐴) ↔ 𝑥 ∈ (Base‘𝐵)))
61	60	anbi1d 631	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → ((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥))) ↔ (𝑥 ∈ (Base‘𝐵) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥)))))
62	59, 61	bitrd 279	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → ((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ↔ (𝑥 ∈ (Base‘𝐵) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥)))))
63	62	anbi1d 631	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚)) ↔ ((𝑥 ∈ (Base‘𝐵) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))))
64	54, 63	bitrd 279	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐴)∀𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚)) ↔ ((𝑥 ∈ (Base‘𝐵) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))))
65	64	opabbidv 5161	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐴)∀𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚))} = {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ (Base‘𝐵) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))})
66	9, 11, 65	mpoeq123dva 7429	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝐴 Func 𝐶), 𝑤 ∈ (Base‘𝐶) ↦ {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐴)∀𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚))}) = (𝑓 ∈ (𝐵 Func 𝐷), 𝑤 ∈ (Base‘𝐷) ↦ {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ (Base‘𝐵) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))}))
67	21, 15, 28, 16, 35	upfval 49337	. 2 ⊢ (𝐴 UP 𝐶) = (𝑓 ∈ (𝐴 Func 𝐶), 𝑤 ∈ (Base‘𝐶) ↦ {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐴)∀𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚))})
68		eqid 2733	. . 3 ⊢ (Base‘𝐵) = (Base‘𝐵)
69		eqid 2733	. . 3 ⊢ (Base‘𝐷) = (Base‘𝐷)
70	68, 69, 29, 17, 36	upfval 49337	. 2 ⊢ (𝐵 UP 𝐷) = (𝑓 ∈ (𝐵 Func 𝐷), 𝑤 ∈ (Base‘𝐷) ↦ {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ (Base‘𝐵) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))})
71	66, 67, 70	3eqtr4g 2793	1 ⊢ (𝜑 → (𝐴 UP 𝐶) = (𝐵 UP 𝐷))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∀wral 3048  ∃!wreu 3345  ⟨cop 4583   class class class wbr 5095  {copab 5157  ⟶wf 6485  ‘cfv 6489  (class class class)co 7355   ∈ cmpo 7357  1^st c1st 7928  2^nd c2nd 7929  Basecbs 17127  Hom chom 17179  compcco 17180  Hom_f chomf 17580  comp_fccomf 17581   Func cfunc 17769   UP cup 49334

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 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677

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 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-riota 7312  df-ov 7358  df-oprab 7359  df-mpo 7360  df-1st 7930  df-2nd 7931  df-map 8761  df-ixp 8832  df-cat 17582  df-cid 17583  df-homf 17584  df-comf 17585  df-func 17773  df-up 49335

This theorem is referenced by:  lmdpropd  49818  cmdpropd  49819  cmddu  49829