Theorem uppropd 49668

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 17860	. . 3 ⊢ (𝜑 → (𝐴 Func 𝐶) = (𝐵 Func 𝐷))
10	3	homfeqbas 17653	. . . 4 ⊢ (𝜑 → (Base‘𝐶) = (Base‘𝐷))
11	10	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐴 Func 𝐶)) → (Base‘𝐶) = (Base‘𝐷))
12	1	homfeqbas 17653	. . . . . . . . 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 2737	. . . . . . . . 9 ⊢ (Base‘𝐶) = (Base‘𝐶)
16		eqid 2737	. . . . . . . . 9 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
17		eqid 2737	. . . . . . . . 9 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
18	3	ad3antrrr 731	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → (Homf ‘𝐶) = (Homf ‘𝐷))
19		simprr 773	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → 𝑤 ∈ (Base‘𝐶))
20	19	ad2antrr 727	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑤 ∈ (Base‘𝐶))
21		eqid 2737	. . . . . . . . . . . 12 ⊢ (Base‘𝐴) = (Base‘𝐴)
22		simprl 771	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → 𝑓 ∈ (𝐴 Func 𝐶))
23	22	func1st2nd 49563	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (1st ‘𝑓)(𝐴 Func 𝐶)(2nd ‘𝑓))
24	21, 15, 23	funcf1 17824	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (1st ‘𝑓):(Base‘𝐴)⟶(Base‘𝐶))
25	24	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → (1st ‘𝑓):(Base‘𝐴)⟶(Base‘𝐶))
26	25	ffvelcdmda 7030	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → ((1st ‘𝑓)‘𝑦) ∈ (Base‘𝐶))
27	15, 16, 17, 18, 20, 26	homfeqval 17654	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) → (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦)) = (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦)))
28		eqid 2737	. . . . . . . . . 10 ⊢ (Hom ‘𝐴) = (Hom ‘𝐴)
29		eqid 2737	. . . . . . . . . 10 ⊢ (Hom ‘𝐵) = (Hom ‘𝐵)
30	1	ad4antr 733	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (Homf ‘𝐴) = (Homf ‘𝐵))
31		simprl 771	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → 𝑥 ∈ (Base‘𝐴))
32	31	ad2antrr 727	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → 𝑥 ∈ (Base‘𝐴))
33		simplr 769	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → 𝑦 ∈ (Base‘𝐴))
34	21, 28, 29, 30, 32, 33	homfeqval 17654	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (𝑥(Hom ‘𝐴)𝑦) = (𝑥(Hom ‘𝐵)𝑦))
35		eqid 2737	. . . . . . . . . . 11 ⊢ (comp‘𝐶) = (comp‘𝐶)
36		eqid 2737	. . . . . . . . . . 11 ⊢ (comp‘𝐷) = (comp‘𝐷)
37	18	ad2antrr 727	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (Homf ‘𝐶) = (Homf ‘𝐷))
38	4	ad5antr 735	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (compf‘𝐶) = (compf‘𝐷))
39	20	ad2antrr 727	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → 𝑤 ∈ (Base‘𝐶))
40	24	ffvelcdmda 7030	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → ((1st ‘𝑓)‘𝑥) ∈ (Base‘𝐶))
41	40	adantrr 718	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → ((1st ‘𝑓)‘𝑥) ∈ (Base‘𝐶))
42	41	ad3antrrr 731	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → ((1st ‘𝑓)‘𝑥) ∈ (Base‘𝐶))
43	26	ad2antrr 727	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → ((1st ‘𝑓)‘𝑦) ∈ (Base‘𝐶))
44		simprr 773	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) → 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))
45	44	ad3antrrr 731	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))
46	23	ad3antrrr 731	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (1st ‘𝑓)(𝐴 Func 𝐶)(2nd ‘𝑓))
47	21, 28, 16, 46, 32, 33	funcf2 17826	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (𝑥(2nd ‘𝑓)𝑦):(𝑥(Hom ‘𝐴)𝑦)⟶(((1st ‘𝑓)‘𝑥)(Hom ‘𝐶)((1st ‘𝑓)‘𝑦)))
48	47	ffvelcdmda 7030	. . . . . . . . . . 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 17665	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚) = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))
50	49	eqeq2d 2748	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) ∧ 𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚) ↔ 𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚)))
51	34, 50	reueqbidva 49293	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)))) ∧ 𝑦 ∈ (Base‘𝐴)) ∧ 𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))) → (∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚)))
52	27, 51	raleqbidva 3302	. . . . . . 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 3302	. . . . . 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 727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → (Homf ‘𝐶) = (Homf ‘𝐷))
56		simplrr 778	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → 𝑤 ∈ (Base‘𝐶))
57	15, 16, 17, 55, 56, 40	homfeqval 17654	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) ∧ 𝑥 ∈ (Base‘𝐴)) → (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥)) = (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥)))
58	57	eleq2d 2823	. . . . . . . 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 2823	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑤 ∈ (Base‘𝐶))) → (𝑥 ∈ (Base‘𝐴) ↔ 𝑥 ∈ (Base‘𝐵)))
61	60	anbi1d 632	. . . . . . 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 632	. . . . 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 5152	. . 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 7434	. 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 49663	. 2 ⊢ (𝐴 UP 𝐶) = (𝑓 ∈ (𝐴 Func 𝐶), 𝑤 ∈ (Base‘𝐶) ↦ {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ (Base‘𝐴) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐴)∀𝑔 ∈ (𝑤(Hom ‘𝐶)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐴)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐶)((1st ‘𝑓)‘𝑦))𝑚))})
68		eqid 2737	. . 3 ⊢ (Base‘𝐵) = (Base‘𝐵)
69		eqid 2737	. . 3 ⊢ (Base‘𝐷) = (Base‘𝐷)
70	68, 69, 29, 17, 36	upfval 49663	. 2 ⊢ (𝐵 UP 𝐷) = (𝑓 ∈ (𝐵 Func 𝐷), 𝑤 ∈ (Base‘𝐷) ↦ {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ (Base‘𝐵) ∧ 𝑚 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑥))) ∧ ∀𝑦 ∈ (Base‘𝐵)∀𝑔 ∈ (𝑤(Hom ‘𝐷)((1st ‘𝑓)‘𝑦))∃!𝑘 ∈ (𝑥(Hom ‘𝐵)𝑦)𝑔 = (((𝑥(2nd ‘𝑓)𝑦)‘𝑘)(⟨𝑤, ((1st ‘𝑓)‘𝑥)⟩(comp‘𝐷)((1st ‘𝑓)‘𝑦))𝑚))})
71	66, 67, 70	3eqtr4g 2797	1 ⊢ (𝜑 → (𝐴 UP 𝐶) = (𝐵 UP 𝐷))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃!wreu 3341  ⟨cop 4574   class class class wbr 5086  {copab 5148  ⟶wf 6488  ‘cfv 6492  (class class class)co 7360   ∈ cmpo 7362  1^st c1st 7933  2^nd c2nd 7934  Basecbs 17170  Hom chom 17222  compcco 17223  Hom_f chomf 17623  comp_fccomf 17624   Func cfunc 17812   UP cup 49660

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 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682

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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-map 8768  df-ixp 8839  df-cat 17625  df-cid 17626  df-homf 17627  df-comf 17628  df-func 17816  df-up 49661

This theorem is referenced by:  lmdpropd  50144  cmdpropd  50145  cmddu  50155