Theorem prfval 18147

Description: Value of the pairing functor. (Contributed by Mario Carneiro, 12-Jan-2017.)

Hypotheses

Ref	Expression
prfval.k	⊢ 𝑃 = (𝐹 ⟨,⟩F 𝐺)
prfval.b	⊢ 𝐵 = (Base‘𝐶)
prfval.h	⊢ 𝐻 = (Hom ‘𝐶)
prfval.c	⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
prfval.d	⊢ (𝜑 → 𝐺 ∈ (𝐶 Func 𝐸))

Assertion

Ref	Expression
prfval	⊢ (𝜑 → 𝑃 = ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩)

Distinct variable groups:   𝑥,ℎ,𝑦,𝐵   𝑥,𝐶,𝑦   ℎ,𝐹,𝑥,𝑦   𝜑,ℎ,𝑥,𝑦   𝑥,𝐷,𝑦   ℎ,𝐺,𝑥,𝑦   ℎ,𝐻,𝑥,𝑦

Allowed substitution hints:   𝐶(ℎ)   𝐷(ℎ)   𝑃(𝑥,𝑦,ℎ)   𝐸(𝑥,𝑦,ℎ)

Proof of Theorem prfval

Dummy variables 𝑓 𝑏 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prfval.k	. 2 ⊢ 𝑃 = (𝐹 ⟨,⟩F 𝐺)
2		df-prf 18123	. . . 4 ⊢ ⟨,⟩F = (𝑓 ∈ V, 𝑔 ∈ V ↦ ⦋dom (1st ‘𝑓) / 𝑏⦌⟨(𝑥 ∈ 𝑏 ↦ ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩), (𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩))⟩)
3	2	a1i 11	. . 3 ⊢ (𝜑 → ⟨,⟩F = (𝑓 ∈ V, 𝑔 ∈ V ↦ ⦋dom (1st ‘𝑓) / 𝑏⦌⟨(𝑥 ∈ 𝑏 ↦ ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩), (𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩))⟩))
4		fvex 6901	. . . . . 6 ⊢ (1st ‘𝑓) ∈ V
5	4	dmex 7898	. . . . 5 ⊢ dom (1st ‘𝑓) ∈ V
6	5	a1i 11	. . . 4 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → dom (1st ‘𝑓) ∈ V)
7		simprl 769	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → 𝑓 = 𝐹)
8	7	fveq2d 6892	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (1st ‘𝑓) = (1st ‘𝐹))
9	8	dmeqd 5903	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → dom (1st ‘𝑓) = dom (1st ‘𝐹))
10		prfval.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐶)
11		eqid 2732	. . . . . . . 8 ⊢ (Base‘𝐷) = (Base‘𝐷)
12		relfunc 17808	. . . . . . . . 9 ⊢ Rel (𝐶 Func 𝐷)
13		prfval.c	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
14		1st2ndbr 8024	. . . . . . . . 9 ⊢ ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
15	12, 13, 14	sylancr 587	. . . . . . . 8 ⊢ (𝜑 → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
16	10, 11, 15	funcf1 17812	. . . . . . 7 ⊢ (𝜑 → (1st ‘𝐹):𝐵⟶(Base‘𝐷))
17	16	fdmd 6725	. . . . . 6 ⊢ (𝜑 → dom (1st ‘𝐹) = 𝐵)
18	17	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → dom (1st ‘𝐹) = 𝐵)
19	9, 18	eqtrd 2772	. . . 4 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → dom (1st ‘𝑓) = 𝐵)
20		simpr 485	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
21		simplrl 775	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑓 = 𝐹)
22	21	fveq2d 6892	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (1st ‘𝑓) = (1st ‘𝐹))
23	22	fveq1d 6890	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ((1st ‘𝑓)‘𝑥) = ((1st ‘𝐹)‘𝑥))
24		simplrr 776	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑔 = 𝐺)
25	24	fveq2d 6892	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (1st ‘𝑔) = (1st ‘𝐺))
26	25	fveq1d 6890	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ((1st ‘𝑔)‘𝑥) = ((1st ‘𝐺)‘𝑥))
27	23, 26	opeq12d 4880	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ = ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩)
28	20, 27	mpteq12dv 5238	. . . . 5 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥 ∈ 𝑏 ↦ ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩) = (𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩))
29		eqidd 2733	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩) = (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩))
30	20, 20, 29	mpoeq123dv 7480	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩)))
31	21	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑓 = 𝐹)
32	31	fveq2d 6892	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (2nd ‘𝑓) = (2nd ‘𝐹))
33	32	oveqd 7422	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑥(2nd ‘𝑓)𝑦) = (𝑥(2nd ‘𝐹)𝑦))
34	33	dmeqd 5903	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → dom (𝑥(2nd ‘𝑓)𝑦) = dom (𝑥(2nd ‘𝐹)𝑦))
35		prfval.h	. . . . . . . . . . . 12 ⊢ 𝐻 = (Hom ‘𝐶)
36		eqid 2732	. . . . . . . . . . . 12 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
37	15	ad4antr 730	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
38		simplr 767	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ 𝐵)
39		simpr 485	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
40	10, 35, 36, 37, 38, 39	funcf2 17814	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑥(2nd ‘𝐹)𝑦):(𝑥𝐻𝑦)⟶(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦)))
41	40	fdmd 6725	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → dom (𝑥(2nd ‘𝐹)𝑦) = (𝑥𝐻𝑦))
42	34, 41	eqtrd 2772	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → dom (𝑥(2nd ‘𝑓)𝑦) = (𝑥𝐻𝑦))
43	33	fveq1d 6890	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((𝑥(2nd ‘𝑓)𝑦)‘ℎ) = ((𝑥(2nd ‘𝐹)𝑦)‘ℎ))
44	24	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑔 = 𝐺)
45	44	fveq2d 6892	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (2nd ‘𝑔) = (2nd ‘𝐺))
46	45	oveqd 7422	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑥(2nd ‘𝑔)𝑦) = (𝑥(2nd ‘𝐺)𝑦))
47	46	fveq1d 6890	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((𝑥(2nd ‘𝑔)𝑦)‘ℎ) = ((𝑥(2nd ‘𝐺)𝑦)‘ℎ))
48	43, 47	opeq12d 4880	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩ = ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩)
49	42, 48	mpteq12dv 5238	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩) = (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))
50	49	3impa 1110	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩) = (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))
51	50	mpoeq3dva 7482	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩)))
52	30, 51	eqtrd 2772	. . . . 5 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩)))
53	28, 52	opeq12d 4880	. . . 4 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ⟨(𝑥 ∈ 𝑏 ↦ ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩), (𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩))⟩ = ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩)
54	6, 19, 53	csbied2 3932	. . 3 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → ⦋dom (1st ‘𝑓) / 𝑏⦌⟨(𝑥 ∈ 𝑏 ↦ ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩), (𝑥 ∈ 𝑏, 𝑦 ∈ 𝑏 ↦ (ℎ ∈ dom (𝑥(2nd ‘𝑓)𝑦) ↦ ⟨((𝑥(2nd ‘𝑓)𝑦)‘ℎ), ((𝑥(2nd ‘𝑔)𝑦)‘ℎ)⟩))⟩ = ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩)
55	13	elexd 3494	. . 3 ⊢ (𝜑 → 𝐹 ∈ V)
56		prfval.d	. . . 4 ⊢ (𝜑 → 𝐺 ∈ (𝐶 Func 𝐸))
57	56	elexd 3494	. . 3 ⊢ (𝜑 → 𝐺 ∈ V)
58		opex 5463	. . . 4 ⊢ ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩ ∈ V
59	58	a1i 11	. . 3 ⊢ (𝜑 → ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩ ∈ V)
60	3, 54, 55, 57, 59	ovmpod 7556	. 2 ⊢ (𝜑 → (𝐹 ⟨,⟩F 𝐺) = ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩)
61	1, 60	eqtrid 2784	1 ⊢ (𝜑 → 𝑃 = ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  Vcvv 3474  ⦋csb 3892  ⟨cop 4633   class class class wbr 5147   ↦ cmpt 5230  dom cdm 5675  Rel wrel 5680  ‘cfv 6540  (class class class)co 7405   ∈ cmpo 7407  1^st c1st 7969  2^nd c2nd 7970  Basecbs 17140  Hom chom 17204   Func cfunc 17800   ⟨,⟩_F cprf 18119

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7971  df-2nd 7972  df-map 8818  df-ixp 8888  df-func 17804  df-prf 18123

This theorem is referenced by:  prf1  18148  prf2fval  18149  prfcl  18151  prf1st  18152  prf2nd  18153  1st2ndprf  18154