Theorem xpsvsca 16625

Description: Value of the scalar multiplication function in a binary structure product. (Contributed by Mario Carneiro, 15-Aug-2015.)

Hypotheses

Ref	Expression
xpssca.t	⊢ 𝑇 = (𝑅 ×s 𝑆)
xpssca.g	⊢ 𝐺 = (Scalar‘𝑅)
xpssca.1	⊢ (𝜑 → 𝑅 ∈ 𝑉)
xpssca.2	⊢ (𝜑 → 𝑆 ∈ 𝑊)
xpsvsca.x	⊢ 𝑋 = (Base‘𝑅)
xpsvsca.y	⊢ 𝑌 = (Base‘𝑆)
xpsvsca.k	⊢ 𝐾 = (Base‘𝐺)
xpsvsca.m	⊢ · = ( ·𝑠 ‘𝑅)
xpsvsca.n	⊢ × = ( ·𝑠 ‘𝑆)
xpsvsca.p	⊢ ∙ = ( ·𝑠 ‘𝑇)
xpsvsca.3	⊢ (𝜑 → 𝐴 ∈ 𝐾)
xpsvsca.4	⊢ (𝜑 → 𝐵 ∈ 𝑋)
xpsvsca.5	⊢ (𝜑 → 𝐶 ∈ 𝑌)
xpsvsca.6	⊢ (𝜑 → (𝐴 · 𝐵) ∈ 𝑋)
xpsvsca.7	⊢ (𝜑 → (𝐴 × 𝐶) ∈ 𝑌)

Assertion

Ref	Expression
xpsvsca	⊢ (𝜑 → (𝐴 ∙ ⟨𝐵, 𝐶⟩) = ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩)

Proof of Theorem xpsvsca

Dummy variables 𝑘 𝑎 𝑥 𝑦 𝑐 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpsvsca.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐾)
2		df-ov 6925	. . . . 5 ⊢ (𝐵(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))𝐶) = ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨𝐵, 𝐶⟩)
3		xpsvsca.4	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑋)
4		xpsvsca.5	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑌)
5		eqid 2777	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))
6	5	xpsfval 16613	. . . . . 6 ⊢ ((𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑌) → (𝐵(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))𝐶) = ◡({𝐵} +𝑐 {𝐶}))
7	3, 4, 6	syl2anc 579	. . . . 5 ⊢ (𝜑 → (𝐵(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))𝐶) = ◡({𝐵} +𝑐 {𝐶}))
8	2, 7	syl5eqr 2827	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨𝐵, 𝐶⟩) = ◡({𝐵} +𝑐 {𝐶}))
9		opelxpi 5392	. . . . . 6 ⊢ ((𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑌) → ⟨𝐵, 𝐶⟩ ∈ (𝑋 × 𝑌))
10	3, 4, 9	syl2anc 579	. . . . 5 ⊢ (𝜑 → ⟨𝐵, 𝐶⟩ ∈ (𝑋 × 𝑌))
11	5	xpsff1o2 16617	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):(𝑋 × 𝑌)–1-1-onto→ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))
12		f1of 6391	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):(𝑋 × 𝑌)–1-1-onto→ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):(𝑋 × 𝑌)⟶ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})))
13	11, 12	ax-mp 5	. . . . . 6 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):(𝑋 × 𝑌)⟶ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))
14	13	ffvelrni 6622	. . . . 5 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝑋 × 𝑌) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨𝐵, 𝐶⟩) ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})))
15	10, 14	syl 17	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨𝐵, 𝐶⟩) ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})))
16	8, 15	eqeltrrd 2859	. . 3 ⊢ (𝜑 → ◡({𝐵} +𝑐 {𝐶}) ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})))
17		xpssca.t	. . . . 5 ⊢ 𝑇 = (𝑅 ×s 𝑆)
18		xpsvsca.x	. . . . 5 ⊢ 𝑋 = (Base‘𝑅)
19		xpsvsca.y	. . . . 5 ⊢ 𝑌 = (Base‘𝑆)
20		xpssca.1	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝑉)
21		xpssca.2	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝑊)
22		xpssca.g	. . . . 5 ⊢ 𝐺 = (Scalar‘𝑅)
23		eqid 2777	. . . . 5 ⊢ (𝐺Xs◡({𝑅} +𝑐 {𝑆})) = (𝐺Xs◡({𝑅} +𝑐 {𝑆}))
24	17, 18, 19, 20, 21, 5, 22, 23	xpsval 16618	. . . 4 ⊢ (𝜑 → 𝑇 = (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})) “s (𝐺Xs◡({𝑅} +𝑐 {𝑆}))))
25	17, 18, 19, 20, 21, 5, 22, 23	xpslem 16619	. . . 4 ⊢ (𝜑 → ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})) = (Base‘(𝐺Xs◡({𝑅} +𝑐 {𝑆}))))
26		f1ocnv 6403	. . . . . 6 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):(𝑋 × 𝑌)–1-1-onto→ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})) → ◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))–1-1-onto→(𝑋 × 𝑌))
27	11, 26	mp1i 13	. . . . 5 ⊢ (𝜑 → ◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))–1-1-onto→(𝑋 × 𝑌))
28		f1ofo 6398	. . . . 5 ⊢ (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))–1-1-onto→(𝑋 × 𝑌) → ◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))–onto→(𝑋 × 𝑌))
29	27, 28	syl 17	. . . 4 ⊢ (𝜑 → ◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))–onto→(𝑋 × 𝑌))
30		ovexd 6956	. . . 4 ⊢ (𝜑 → (𝐺Xs◡({𝑅} +𝑐 {𝑆})) ∈ V)
31	22	fvexi 6460	. . . . . . 7 ⊢ 𝐺 ∈ V
32	31	a1i 11	. . . . . 6 ⊢ (⊤ → 𝐺 ∈ V)
33		ovex 6954	. . . . . . . 8 ⊢ ({𝑅} +𝑐 {𝑆}) ∈ V
34	33	cnvex 7392	. . . . . . 7 ⊢ ◡({𝑅} +𝑐 {𝑆}) ∈ V
35	34	a1i 11	. . . . . 6 ⊢ (⊤ → ◡({𝑅} +𝑐 {𝑆}) ∈ V)
36	23, 32, 35	prdssca 16502	. . . . 5 ⊢ (⊤ → 𝐺 = (Scalar‘(𝐺Xs◡({𝑅} +𝑐 {𝑆}))))
37	36	mptru 1609	. . . 4 ⊢ 𝐺 = (Scalar‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))
38		xpsvsca.k	. . . 4 ⊢ 𝐾 = (Base‘𝐺)
39		eqid 2777	. . . 4 ⊢ ( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆}))) = ( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))
40		xpsvsca.p	. . . 4 ⊢ ∙ = ( ·𝑠 ‘𝑇)
41	27	f1ovscpbl 16572	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐾 ∧ 𝑏 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})) ∧ 𝑐 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})))) → ((◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘𝑏) = (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘𝑐) → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘(𝑎( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))𝑏)) = (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘(𝑎( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))𝑐))))
42	24, 25, 29, 30, 37, 38, 39, 40, 41	imasvscaval 16584	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝐾 ∧ ◡({𝐵} +𝑐 {𝐶}) ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))) → (𝐴 ∙ (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({𝐵} +𝑐 {𝐶}))) = (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘(𝐴( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))◡({𝐵} +𝑐 {𝐶}))))
43	1, 16, 42	mpd3an23 1536	. 2 ⊢ (𝜑 → (𝐴 ∙ (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({𝐵} +𝑐 {𝐶}))) = (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘(𝐴( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))◡({𝐵} +𝑐 {𝐶}))))
44		f1ocnvfv 6806	. . . . 5 ⊢ (((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):(𝑋 × 𝑌)–1-1-onto→ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})) ∧ ⟨𝐵, 𝐶⟩ ∈ (𝑋 × 𝑌)) → (((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨𝐵, 𝐶⟩) = ◡({𝐵} +𝑐 {𝐶}) → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({𝐵} +𝑐 {𝐶})) = ⟨𝐵, 𝐶⟩))
45	11, 10, 44	sylancr 581	. . . 4 ⊢ (𝜑 → (((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨𝐵, 𝐶⟩) = ◡({𝐵} +𝑐 {𝐶}) → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({𝐵} +𝑐 {𝐶})) = ⟨𝐵, 𝐶⟩))
46	8, 45	mpd 15	. . 3 ⊢ (𝜑 → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({𝐵} +𝑐 {𝐶})) = ⟨𝐵, 𝐶⟩)
47	46	oveq2d 6938	. 2 ⊢ (𝜑 → (𝐴 ∙ (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({𝐵} +𝑐 {𝐶}))) = (𝐴 ∙ ⟨𝐵, 𝐶⟩))
48		iftrue 4312	. . . . . . . . . . . 12 ⊢ (𝑘 = ∅ → if(𝑘 = ∅, 𝑅, 𝑆) = 𝑅)
49	48	fveq2d 6450	. . . . . . . . . . 11 ⊢ (𝑘 = ∅ → ( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆)) = ( ·𝑠 ‘𝑅))
50		xpsvsca.m	. . . . . . . . . . 11 ⊢ · = ( ·𝑠 ‘𝑅)
51	49, 50	syl6eqr 2831	. . . . . . . . . 10 ⊢ (𝑘 = ∅ → ( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆)) = · )
52		eqidd 2778	. . . . . . . . . 10 ⊢ (𝑘 = ∅ → 𝐴 = 𝐴)
53		iftrue 4312	. . . . . . . . . 10 ⊢ (𝑘 = ∅ → if(𝑘 = ∅, 𝐵, 𝐶) = 𝐵)
54	51, 52, 53	oveq123d 6943	. . . . . . . . 9 ⊢ (𝑘 = ∅ → (𝐴( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆))if(𝑘 = ∅, 𝐵, 𝐶)) = (𝐴 · 𝐵))
55		iftrue 4312	. . . . . . . . 9 ⊢ (𝑘 = ∅ → if(𝑘 = ∅, (𝐴 · 𝐵), (𝐴 × 𝐶)) = (𝐴 · 𝐵))
56	54, 55	eqtr4d 2816	. . . . . . . 8 ⊢ (𝑘 = ∅ → (𝐴( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆))if(𝑘 = ∅, 𝐵, 𝐶)) = if(𝑘 = ∅, (𝐴 · 𝐵), (𝐴 × 𝐶)))
57		iffalse 4315	. . . . . . . . . . . 12 ⊢ (¬ 𝑘 = ∅ → if(𝑘 = ∅, 𝑅, 𝑆) = 𝑆)
58	57	fveq2d 6450	. . . . . . . . . . 11 ⊢ (¬ 𝑘 = ∅ → ( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆)) = ( ·𝑠 ‘𝑆))
59		xpsvsca.n	. . . . . . . . . . 11 ⊢ × = ( ·𝑠 ‘𝑆)
60	58, 59	syl6eqr 2831	. . . . . . . . . 10 ⊢ (¬ 𝑘 = ∅ → ( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆)) = × )
61		eqidd 2778	. . . . . . . . . 10 ⊢ (¬ 𝑘 = ∅ → 𝐴 = 𝐴)
62		iffalse 4315	. . . . . . . . . 10 ⊢ (¬ 𝑘 = ∅ → if(𝑘 = ∅, 𝐵, 𝐶) = 𝐶)
63	60, 61, 62	oveq123d 6943	. . . . . . . . 9 ⊢ (¬ 𝑘 = ∅ → (𝐴( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆))if(𝑘 = ∅, 𝐵, 𝐶)) = (𝐴 × 𝐶))
64		iffalse 4315	. . . . . . . . 9 ⊢ (¬ 𝑘 = ∅ → if(𝑘 = ∅, (𝐴 · 𝐵), (𝐴 × 𝐶)) = (𝐴 × 𝐶))
65	63, 64	eqtr4d 2816	. . . . . . . 8 ⊢ (¬ 𝑘 = ∅ → (𝐴( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆))if(𝑘 = ∅, 𝐵, 𝐶)) = if(𝑘 = ∅, (𝐴 · 𝐵), (𝐴 × 𝐶)))
66	56, 65	pm2.61i 177	. . . . . . 7 ⊢ (𝐴( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆))if(𝑘 = ∅, 𝐵, 𝐶)) = if(𝑘 = ∅, (𝐴 · 𝐵), (𝐴 × 𝐶))
67	20	adantr 474	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → 𝑅 ∈ 𝑉)
68	21	adantr 474	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → 𝑆 ∈ 𝑊)
69		simpr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → 𝑘 ∈ 2o)
70		xpscfv 16608	. . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊 ∧ 𝑘 ∈ 2o) → (◡({𝑅} +𝑐 {𝑆})‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))
71	67, 68, 69, 70	syl3anc 1439	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (◡({𝑅} +𝑐 {𝑆})‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))
72	71	fveq2d 6450	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → ( ·𝑠 ‘(◡({𝑅} +𝑐 {𝑆})‘𝑘)) = ( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆)))
73		eqidd 2778	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → 𝐴 = 𝐴)
74	3	adantr 474	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → 𝐵 ∈ 𝑋)
75	4	adantr 474	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → 𝐶 ∈ 𝑌)
76		xpscfv 16608	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑌 ∧ 𝑘 ∈ 2o) → (◡({𝐵} +𝑐 {𝐶})‘𝑘) = if(𝑘 = ∅, 𝐵, 𝐶))
77	74, 75, 69, 76	syl3anc 1439	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (◡({𝐵} +𝑐 {𝐶})‘𝑘) = if(𝑘 = ∅, 𝐵, 𝐶))
78	72, 73, 77	oveq123d 6943	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (𝐴( ·𝑠 ‘(◡({𝑅} +𝑐 {𝑆})‘𝑘))(◡({𝐵} +𝑐 {𝐶})‘𝑘)) = (𝐴( ·𝑠 ‘if(𝑘 = ∅, 𝑅, 𝑆))if(𝑘 = ∅, 𝐵, 𝐶)))
79		xpsvsca.6	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ 𝑋)
80	79	adantr 474	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (𝐴 · 𝐵) ∈ 𝑋)
81		xpsvsca.7	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 × 𝐶) ∈ 𝑌)
82	81	adantr 474	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (𝐴 × 𝐶) ∈ 𝑌)
83		xpscfv 16608	. . . . . . . 8 ⊢ (((𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐴 × 𝐶) ∈ 𝑌 ∧ 𝑘 ∈ 2o) → (◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})‘𝑘) = if(𝑘 = ∅, (𝐴 · 𝐵), (𝐴 × 𝐶)))
84	80, 82, 69, 83	syl3anc 1439	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})‘𝑘) = if(𝑘 = ∅, (𝐴 · 𝐵), (𝐴 × 𝐶)))
85	66, 78, 84	3eqtr4a 2839	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (𝐴( ·𝑠 ‘(◡({𝑅} +𝑐 {𝑆})‘𝑘))(◡({𝐵} +𝑐 {𝐶})‘𝑘)) = (◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})‘𝑘))
86	85	mpteq2dva 4979	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ 2o ↦ (𝐴( ·𝑠 ‘(◡({𝑅} +𝑐 {𝑆})‘𝑘))(◡({𝐵} +𝑐 {𝐶})‘𝑘))) = (𝑘 ∈ 2o ↦ (◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})‘𝑘)))
87		eqid 2777	. . . . . 6 ⊢ (Base‘(𝐺Xs◡({𝑅} +𝑐 {𝑆}))) = (Base‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))
88	31	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ V)
89		2on 7852	. . . . . . 7 ⊢ 2o ∈ On
90	89	a1i 11	. . . . . 6 ⊢ (𝜑 → 2o ∈ On)
91		xpscfn 16605	. . . . . . 7 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → ◡({𝑅} +𝑐 {𝑆}) Fn 2o)
92	20, 21, 91	syl2anc 579	. . . . . 6 ⊢ (𝜑 → ◡({𝑅} +𝑐 {𝑆}) Fn 2o)
93	16, 25	eleqtrd 2860	. . . . . 6 ⊢ (𝜑 → ◡({𝐵} +𝑐 {𝐶}) ∈ (Base‘(𝐺Xs◡({𝑅} +𝑐 {𝑆}))))
94	23, 87, 39, 38, 88, 90, 92, 1, 93	prdsvscaval 16525	. . . . 5 ⊢ (𝜑 → (𝐴( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))◡({𝐵} +𝑐 {𝐶})) = (𝑘 ∈ 2o ↦ (𝐴( ·𝑠 ‘(◡({𝑅} +𝑐 {𝑆})‘𝑘))(◡({𝐵} +𝑐 {𝐶})‘𝑘))))
95		xpscfn 16605	. . . . . . 7 ⊢ (((𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐴 × 𝐶) ∈ 𝑌) → ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}) Fn 2o)
96	79, 81, 95	syl2anc 579	. . . . . 6 ⊢ (𝜑 → ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}) Fn 2o)
97		dffn5 6501	. . . . . 6 ⊢ (◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}) Fn 2o ↔ ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}) = (𝑘 ∈ 2o ↦ (◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})‘𝑘)))
98	96, 97	sylib 210	. . . . 5 ⊢ (𝜑 → ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}) = (𝑘 ∈ 2o ↦ (◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})‘𝑘)))
99	86, 94, 98	3eqtr4d 2823	. . . 4 ⊢ (𝜑 → (𝐴( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))◡({𝐵} +𝑐 {𝐶})) = ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}))
100	99	fveq2d 6450	. . 3 ⊢ (𝜑 → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘(𝐴( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))◡({𝐵} +𝑐 {𝐶}))) = (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})))
101		df-ov 6925	. . . . 5 ⊢ ((𝐴 · 𝐵)(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))(𝐴 × 𝐶)) = ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩)
102	5	xpsfval 16613	. . . . . 6 ⊢ (((𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐴 × 𝐶) ∈ 𝑌) → ((𝐴 · 𝐵)(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))(𝐴 × 𝐶)) = ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}))
103	79, 81, 102	syl2anc 579	. . . . 5 ⊢ (𝜑 → ((𝐴 · 𝐵)(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))(𝐴 × 𝐶)) = ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}))
104	101, 103	syl5eqr 2827	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩) = ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}))
105		opelxpi 5392	. . . . . 6 ⊢ (((𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐴 × 𝐶) ∈ 𝑌) → ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩ ∈ (𝑋 × 𝑌))
106	79, 81, 105	syl2anc 579	. . . . 5 ⊢ (𝜑 → ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩ ∈ (𝑋 × 𝑌))
107		f1ocnvfv 6806	. . . . 5 ⊢ (((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})):(𝑋 × 𝑌)–1-1-onto→ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦})) ∧ ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩ ∈ (𝑋 × 𝑌)) → (((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩) = ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}) → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})) = ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩))
108	11, 106, 107	sylancr 581	. . . 4 ⊢ (𝜑 → (((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩) = ◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)}) → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})) = ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩))
109	104, 108	mpd 15	. . 3 ⊢ (𝜑 → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘◡({(𝐴 · 𝐵)} +𝑐 {(𝐴 × 𝐶)})) = ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩)
110	100, 109	eqtrd 2813	. 2 ⊢ (𝜑 → (◡(𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ◡({𝑥} +𝑐 {𝑦}))‘(𝐴( ·𝑠 ‘(𝐺Xs◡({𝑅} +𝑐 {𝑆})))◡({𝐵} +𝑐 {𝐶}))) = ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩)
111	43, 47, 110	3eqtr3d 2821	1 ⊢ (𝜑 → (𝐴 ∙ ⟨𝐵, 𝐶⟩) = ⟨(𝐴 · 𝐵), (𝐴 × 𝐶)⟩)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 386   = wceq 1601  ⊤wtru 1602   ∈ wcel 2106  Vcvv 3397  ∅c0 4140  ifcif 4306  {csn 4397  ⟨cop 4403   ↦ cmpt 4965   × cxp 5353  ^◡ccnv 5354  ran crn 5356  Oncon0 5976   Fn wfn 6130  ⟶wf 6131  –onto→wfo 6133  –1-1-onto→wf1o 6134  ‘cfv 6135  (class class class)co 6922   ↦ cmpt2 6924  2_oc2o 7837   +_𝑐 ccda 9324  Basecbs 16255  Scalarcsca 16341   ·_𝑠 cvsca 16342  X_scprds 16492   ×_s cxps 16552

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2054  ax-8 2108  ax-9 2115  ax-10 2134  ax-11 2149  ax-12 2162  ax-13 2333  ax-ext 2753  ax-rep 5006  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226  ax-cnex 10328  ax-resscn 10329  ax-1cn 10330  ax-icn 10331  ax-addcl 10332  ax-addrcl 10333  ax-mulcl 10334  ax-mulrcl 10335  ax-mulcom 10336  ax-addass 10337  ax-mulass 10338  ax-distr 10339  ax-i2m1 10340  ax-1ne0 10341  ax-1rid 10342  ax-rnegex 10343  ax-rrecex 10344  ax-cnre 10345  ax-pre-lttri 10346  ax-pre-lttrn 10347  ax-pre-ltadd 10348  ax-pre-mulgt0 10349

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3or 1072  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2550  df-eu 2586  df-clab 2763  df-cleq 2769  df-clel 2773  df-nfc 2920  df-ne 2969  df-nel 3075  df-ral 3094  df-rex 3095  df-reu 3096  df-rab 3098  df-v 3399  df-sbc 3652  df-csb 3751  df-dif 3794  df-un 3796  df-in 3798  df-ss 3805  df-pss 3807  df-nul 4141  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-tp 4402  df-op 4404  df-uni 4672  df-int 4711  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-tr 4988  df-id 5261  df-eprel 5266  df-po 5274  df-so 5275  df-fr 5314  df-we 5316  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367  df-ima 5368  df-pred 5933  df-ord 5979  df-on 5980  df-lim 5981  df-suc 5982  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-f1 6140  df-fo 6141  df-f1o 6142  df-fv 6143  df-riota 6883  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-om 7344  df-1st 7445  df-2nd 7446  df-wrecs 7689  df-recs 7751  df-rdg 7789  df-1o 7843  df-2o 7844  df-oadd 7847  df-er 8026  df-map 8142  df-ixp 8195  df-en 8242  df-dom 8243  df-sdom 8244  df-fin 8245  df-sup 8636  df-inf 8637  df-cda 9325  df-pnf 10413  df-mnf 10414  df-xr 10415  df-ltxr 10416  df-le 10417  df-sub 10608  df-neg 10609  df-nn 11375  df-2 11438  df-3 11439  df-4 11440  df-5 11441  df-6 11442  df-7 11443  df-8 11444  df-9 11445  df-n0 11643  df-z 11729  df-dec 11846  df-uz 11993  df-fz 12644  df-struct 16257  df-ndx 16258  df-slot 16259  df-base 16261  df-plusg 16351  df-mulr 16352  df-sca 16354  df-vsca 16355  df-ip 16356  df-tset 16357  df-ple 16358  df-ds 16360  df-hom 16362  df-cco 16363  df-prds 16494  df-imas 16554  df-xps 16556

This theorem is referenced by: (None)