xpcco - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > xpcco		Structured version Visualization version GIF version

Theorem xpcco 18118

Description: Value of composition in the binary product of categories. (Contributed by Mario Carneiro, 11-Jan-2017.)

**Hypotheses**
Ref	Expression
xpccofval.t	⊢ 𝑇 = (𝐶 ×_c 𝐷)
xpccofval.b	⊢ 𝐵 = (Base‘𝑇)
xpccofval.k	⊢ 𝐾 = (Hom ‘𝑇)
xpccofval.o1	⊢ · = (comp‘𝐶)
xpccofval.o2	⊢ ∙ = (comp‘𝐷)
xpccofval.o	⊢ 𝑂 = (comp‘𝑇)
xpcco.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
xpcco.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
xpcco.z	⊢ (𝜑 → 𝑍 ∈ 𝐵)
xpcco.f	⊢ (𝜑 → 𝐹 ∈ (𝑋𝐾𝑌))
xpcco.g	⊢ (𝜑 → 𝐺 ∈ (𝑌𝐾𝑍))

**Assertion**
Ref	Expression
xpcco	⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩𝑂𝑍)𝐹) = ⟨((1^st ‘𝐺)(⟨(1^st ‘𝑋), (1^st ‘𝑌)⟩ · (1^st ‘𝑍))(1^st ‘𝐹)), ((2^nd ‘𝐺)(⟨(2^nd ‘𝑋), (2^nd ‘𝑌)⟩ ∙ (2^nd ‘𝑍))(2^nd ‘𝐹))⟩)

Proof of Theorem xpcco Dummy variables 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpccofval.t	. . 3 ⊢ 𝑇 = (𝐶 ×_c 𝐷)
2		xpccofval.b	. . 3 ⊢ 𝐵 = (Base‘𝑇)
3		xpccofval.k	. . 3 ⊢ 𝐾 = (Hom ‘𝑇)
4		xpccofval.o1	. . 3 ⊢ · = (comp‘𝐶)
5		xpccofval.o2	. . 3 ⊢ ∙ = (comp‘𝐷)
6		xpccofval.o	. . 3 ⊢ 𝑂 = (comp‘𝑇)
7	1, 2, 3, 4, 5, 6	xpccofval 18117	. 2 ⊢ 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2^nd ‘𝑥)𝐾𝑦), 𝑓 ∈ (𝐾‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓))⟩))
8		xpcco.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
9		xpcco.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
10	8, 9	opelxpd 5671	. . 3 ⊢ (𝜑 → ⟨𝑋, 𝑌⟩ ∈ (𝐵 × 𝐵))
11		xpcco.z	. . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
12	11	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝑋, 𝑌⟩) → 𝑍 ∈ 𝐵)
13		ovex 7401	. . . . 5 ⊢ ((2^nd ‘𝑥)𝐾𝑦) ∈ V
14		fvex 6855	. . . . 5 ⊢ (𝐾‘𝑥) ∈ V
15	13, 14	mpoex 8033	. . . 4 ⊢ (𝑔 ∈ ((2^nd ‘𝑥)𝐾𝑦), 𝑓 ∈ (𝐾‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓))⟩) ∈ V
16	15	a1i 11	. . 3 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (𝑔 ∈ ((2^nd ‘𝑥)𝐾𝑦), 𝑓 ∈ (𝐾‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓))⟩) ∈ V)
17		xpcco.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐾𝑍))
18	17	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → 𝐺 ∈ (𝑌𝐾𝑍))
19		simprl 771	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → 𝑥 = ⟨𝑋, 𝑌⟩)
20	19	fveq2d 6846	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (2^nd ‘𝑥) = (2^nd ‘⟨𝑋, 𝑌⟩))
21		op2ndg 7956	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (2^nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
22	8, 9, 21	syl2anc 585	. . . . . . . 8 ⊢ (𝜑 → (2^nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
23	22	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (2^nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
24	20, 23	eqtrd 2772	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (2^nd ‘𝑥) = 𝑌)
25		simprr 773	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → 𝑦 = 𝑍)
26	24, 25	oveq12d 7386	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → ((2^nd ‘𝑥)𝐾𝑦) = (𝑌𝐾𝑍))
27	18, 26	eleqtrrd 2840	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → 𝐺 ∈ ((2^nd ‘𝑥)𝐾𝑦))
28		xpcco.f	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐾𝑌))
29	28	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → 𝐹 ∈ (𝑋𝐾𝑌))
30	19	fveq2d 6846	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (𝐾‘𝑥) = (𝐾‘⟨𝑋, 𝑌⟩))
31		df-ov 7371	. . . . . . 7 ⊢ (𝑋𝐾𝑌) = (𝐾‘⟨𝑋, 𝑌⟩)
32	30, 31	eqtr4di 2790	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (𝐾‘𝑥) = (𝑋𝐾𝑌))
33	29, 32	eleqtrrd 2840	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → 𝐹 ∈ (𝐾‘𝑥))
34	33	adantr 480	. . . 4 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ 𝑔 = 𝐺) → 𝐹 ∈ (𝐾‘𝑥))
35		opex 5419	. . . . 5 ⊢ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓))⟩ ∈ V
36	35	a1i 11	. . . 4 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓))⟩ ∈ V)
37	19	fveq2d 6846	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (1^st ‘𝑥) = (1^st ‘⟨𝑋, 𝑌⟩))
38		op1stg 7955	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (1^st ‘⟨𝑋, 𝑌⟩) = 𝑋)
39	8, 9, 38	syl2anc 585	. . . . . . . . . . . 12 ⊢ (𝜑 → (1^st ‘⟨𝑋, 𝑌⟩) = 𝑋)
40	39	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (1^st ‘⟨𝑋, 𝑌⟩) = 𝑋)
41	37, 40	eqtrd 2772	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → (1^st ‘𝑥) = 𝑋)
42	41	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1^st ‘𝑥) = 𝑋)
43	42	fveq2d 6846	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1^st ‘(1^st ‘𝑥)) = (1^st ‘𝑋))
44	24	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2^nd ‘𝑥) = 𝑌)
45	44	fveq2d 6846	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1^st ‘(2^nd ‘𝑥)) = (1^st ‘𝑌))
46	43, 45	opeq12d 4839	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ = ⟨(1^st ‘𝑋), (1^st ‘𝑌)⟩)
47		simplrr 778	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑦 = 𝑍)
48	47	fveq2d 6846	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1^st ‘𝑦) = (1^st ‘𝑍))
49	46, 48	oveq12d 7386	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦)) = (⟨(1^st ‘𝑋), (1^st ‘𝑌)⟩ · (1^st ‘𝑍)))
50		simprl 771	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑔 = 𝐺)
51	50	fveq2d 6846	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1^st ‘𝑔) = (1^st ‘𝐺))
52		simprr 773	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑓 = 𝐹)
53	52	fveq2d 6846	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1^st ‘𝑓) = (1^st ‘𝐹))
54	49, 51, 53	oveq123d 7389	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)) = ((1^st ‘𝐺)(⟨(1^st ‘𝑋), (1^st ‘𝑌)⟩ · (1^st ‘𝑍))(1^st ‘𝐹)))
55	42	fveq2d 6846	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2^nd ‘(1^st ‘𝑥)) = (2^nd ‘𝑋))
56	44	fveq2d 6846	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2^nd ‘(2^nd ‘𝑥)) = (2^nd ‘𝑌))
57	55, 56	opeq12d 4839	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ = ⟨(2^nd ‘𝑋), (2^nd ‘𝑌)⟩)
58	47	fveq2d 6846	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2^nd ‘𝑦) = (2^nd ‘𝑍))
59	57, 58	oveq12d 7386	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦)) = (⟨(2^nd ‘𝑋), (2^nd ‘𝑌)⟩ ∙ (2^nd ‘𝑍)))
60	50	fveq2d 6846	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2^nd ‘𝑔) = (2^nd ‘𝐺))
61	52	fveq2d 6846	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2^nd ‘𝑓) = (2^nd ‘𝐹))
62	59, 60, 61	oveq123d 7389	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓)) = ((2^nd ‘𝐺)(⟨(2^nd ‘𝑋), (2^nd ‘𝑌)⟩ ∙ (2^nd ‘𝑍))(2^nd ‘𝐹)))
63	54, 62	opeq12d 4839	. . . 4 ⊢ (((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓))⟩ = ⟨((1^st ‘𝐺)(⟨(1^st ‘𝑋), (1^st ‘𝑌)⟩ · (1^st ‘𝑍))(1^st ‘𝐹)), ((2^nd ‘𝐺)(⟨(2^nd ‘𝑋), (2^nd ‘𝑌)⟩ ∙ (2^nd ‘𝑍))(2^nd ‘𝐹))⟩)
64	27, 34, 36, 63	ovmpodv2 7526	. . 3 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑦 = 𝑍)) → ((⟨𝑋, 𝑌⟩𝑂𝑍) = (𝑔 ∈ ((2^nd ‘𝑥)𝐾𝑦), 𝑓 ∈ (𝐾‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓))⟩) → (𝐺(⟨𝑋, 𝑌⟩𝑂𝑍)𝐹) = ⟨((1^st ‘𝐺)(⟨(1^st ‘𝑋), (1^st ‘𝑌)⟩ · (1^st ‘𝑍))(1^st ‘𝐹)), ((2^nd ‘𝐺)(⟨(2^nd ‘𝑋), (2^nd ‘𝑌)⟩ ∙ (2^nd ‘𝑍))(2^nd ‘𝐹))⟩))
65	10, 12, 16, 64	ovmpodv 7525	. 2 ⊢ (𝜑 → (𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2^nd ‘𝑥)𝐾𝑦), 𝑓 ∈ (𝐾‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩ · (1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩ ∙ (2^nd ‘𝑦))(2^nd ‘𝑓))⟩)) → (𝐺(⟨𝑋, 𝑌⟩𝑂𝑍)𝐹) = ⟨((1^st ‘𝐺)(⟨(1^st ‘𝑋), (1^st ‘𝑌)⟩ · (1^st ‘𝑍))(1^st ‘𝐹)), ((2^nd ‘𝐺)(⟨(2^nd ‘𝑋), (2^nd ‘𝑌)⟩ ∙ (2^nd ‘𝑍))(2^nd ‘𝐹))⟩))
66	7, 65	mpi 20	1 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩𝑂𝑍)𝐹) = ⟨((1^st ‘𝐺)(⟨(1^st ‘𝑋), (1^st ‘𝑌)⟩ · (1^st ‘𝑍))(1^st ‘𝐹)), ((2^nd ‘𝐺)(⟨(2^nd ‘𝑋), (2^nd ‘𝑌)⟩ ∙ (2^nd ‘𝑍))(2^nd ‘𝐹))⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ⟨cop 4588 × cxp 5630 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 1^st c1st 7941 2^nd c2nd 7942 Basecbs 17148 Hom chom 17200 compcco 17201 ×_c cxpc 18103

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 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 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-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-uz 12764 df-fz 13436 df-struct 17086 df-slot 17121 df-ndx 17133 df-base 17149 df-hom 17213 df-cco 17214 df-xpc 18107

This theorem is referenced by: xpcco1st 18119 xpcco2nd 18120 xpcco2 18122 xpccatid 18123 swapfcoa 49637

W3C validator