Theorem psrplusgg 14825

Description: The addition operation of the multivariate power series structure. (Contributed by Mario Carneiro, 28-Dec-2014.) (Revised by Mario Carneiro, 2-Oct-2015.)

Hypotheses

Ref	Expression
psrplusg.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
psrplusg.b	⊢ 𝐵 = (Base‘𝑆)
psrplusg.a	⊢ + = (+g‘𝑅)
psrplusg.p	⊢ ✚ = (+g‘𝑆)

Assertion

Ref	Expression
psrplusgg	⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ✚ = ( ∘𝑓 + ↾ (𝐵 × 𝐵)))

Proof of Theorem psrplusgg

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

Step	Hyp	Ref	Expression
1		psrplusg.s	. . . 4 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
2		eqid 2232	. . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅)
3		psrplusg.a	. . . 4 ⊢ + = (+g‘𝑅)
4		eqid 2232	. . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅)
5		eqid 2232	. . . 4 ⊢ (TopOpen‘𝑅) = (TopOpen‘𝑅)
6		eqid 2232	. . . 4 ⊢ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
7		psrplusg.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑆)
8		simpl 109	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → 𝐼 ∈ 𝑉)
9		simpr 110	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → 𝑅 ∈ 𝑊)
10	1, 2, 6, 7, 8, 9	psrbasg 14821	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → 𝐵 = ((Base‘𝑅) ↑𝑚 {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}))
11		eqid 2232	. . . 4 ⊢ ( ∘𝑓 + ↾ (𝐵 × 𝐵)) = ( ∘𝑓 + ↾ (𝐵 × 𝐵))
12		eqid 2232	. . . 4 ⊢ (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥))))))) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))
13		eqid 2232	. . . 4 ⊢ (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓)) = (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))
14		eqidd 2233	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)})) = (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)})))
15	1, 2, 3, 4, 5, 6, 10, 11, 12, 13, 14, 8, 9	psrval 14806	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → 𝑆 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩}))
16	15	fveq2d 5673	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (+g‘𝑆) = (+g‘({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})))
17		psrplusg.p	. . 3 ⊢ ✚ = (+g‘𝑆)
18	17	a1i 9	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ✚ = (+g‘𝑆))
19		plusgslid 13317	. . 3 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
20		basfn 13263	. . . . . 6 ⊢ Base Fn V
21		fnpsr 14807	. . . . . . . 8 ⊢ mPwSer Fn (V × V)
22	8	elexd 2826	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → 𝐼 ∈ V)
23	9	elexd 2826	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → 𝑅 ∈ V)
24		fnovex 6082	. . . . . . . 8 ⊢ (( mPwSer Fn (V × V) ∧ 𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) ∈ V)
25	21, 22, 23, 24	mp3an2i 1379	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝐼 mPwSer 𝑅) ∈ V)
26	1, 25	eqeltrid 2319	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → 𝑆 ∈ V)
27		funfvex 5686	. . . . . . 7 ⊢ ((Fun Base ∧ 𝑆 ∈ dom Base) → (Base‘𝑆) ∈ V)
28	27	funfni 5457	. . . . . 6 ⊢ ((Base Fn V ∧ 𝑆 ∈ V) → (Base‘𝑆) ∈ V)
29	20, 26, 28	sylancr 414	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (Base‘𝑆) ∈ V)
30	7, 29	eqeltrid 2319	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → 𝐵 ∈ V)
31	30, 30	ofmresex 6329	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ( ∘𝑓 + ↾ (𝐵 × 𝐵)) ∈ V)
32		mpoexga 6407	. . . . 5 ⊢ ((𝐵 ∈ V ∧ 𝐵 ∈ V) → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥))))))) ∈ V)
33	30, 30, 32	syl2anc 411	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥))))))) ∈ V)
34		funfvex 5686	. . . . . . 7 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
35	34	funfni 5457	. . . . . 6 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
36	20, 23, 35	sylancr 414	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (Base‘𝑅) ∈ V)
37		mpoexga 6407	. . . . 5 ⊢ (((Base‘𝑅) ∈ V ∧ 𝐵 ∈ V) → (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓)) ∈ V)
38	36, 30, 37	syl2anc 411	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓)) ∈ V)
39		fnmap 6888	. . . . . . . 8 ⊢ ↑𝑚 Fn (V × V)
40		nn0ex 9501	. . . . . . . . 9 ⊢ ℕ0 ∈ V
41	40	a1i 9	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ℕ0 ∈ V)
42		fnovex 6082	. . . . . . . 8 ⊢ (( ↑𝑚 Fn (V × V) ∧ ℕ0 ∈ V ∧ 𝐼 ∈ V) → (ℕ0 ↑𝑚 𝐼) ∈ V)
43	39, 41, 22, 42	mp3an2i 1379	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (ℕ0 ↑𝑚 𝐼) ∈ V)
44		rabexg 4254	. . . . . . 7 ⊢ ((ℕ0 ↑𝑚 𝐼) ∈ V → {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∈ V)
45	43, 44	syl 14	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∈ V)
46		topnfn 13449	. . . . . . . 8 ⊢ TopOpen Fn V
47		funfvex 5686	. . . . . . . . 9 ⊢ ((Fun TopOpen ∧ 𝑅 ∈ dom TopOpen) → (TopOpen‘𝑅) ∈ V)
48	47	funfni 5457	. . . . . . . 8 ⊢ ((TopOpen Fn V ∧ 𝑅 ∈ V) → (TopOpen‘𝑅) ∈ V)
49	46, 23, 48	sylancr 414	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (TopOpen‘𝑅) ∈ V)
50		snexg 4296	. . . . . . 7 ⊢ ((TopOpen‘𝑅) ∈ V → {(TopOpen‘𝑅)} ∈ V)
51	49, 50	syl 14	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → {(TopOpen‘𝑅)} ∈ V)
52		xpexg 4863	. . . . . 6 ⊢ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∈ V ∧ {(TopOpen‘𝑅)} ∈ V) → ({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}) ∈ V)
53	45, 51, 52	syl2anc 411	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}) ∈ V)
54		ptex 13469	. . . . 5 ⊢ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}) ∈ V → (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)})) ∈ V)
55	53, 54	syl 14	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)})) ∈ V)
56	30, 31, 33, 9, 38, 55	psrvalstrd 14808	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩}) Struct ⟨1, 9⟩)
57		plusgndxnn 13316	. . . . 5 ⊢ (+g‘ndx) ∈ ℕ
58		opexg 4343	. . . . 5 ⊢ (((+g‘ndx) ∈ ℕ ∧ ( ∘𝑓 + ↾ (𝐵 × 𝐵)) ∈ V) → ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩ ∈ V)
59	57, 31, 58	sylancr 414	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩ ∈ V)
60		snsstp2 3844	. . . . . 6 ⊢ {⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩} ⊆ {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩}
61		ssun1 3381	. . . . . 6 ⊢ {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})
62	60, 61	sstri 3246	. . . . 5 ⊢ {⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})
63		snssg 3827	. . . . 5 ⊢ (⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩ ∈ V → (⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩ ∈ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩}) ↔ {⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})))
64	62, 63	mpbiri 168	. . . 4 ⊢ (⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩ ∈ V → ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩ ∈ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩}))
65	59, 64	syl 14	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩ ∈ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩}))
66	19, 56, 31, 65	opelstrsl 13319	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ( ∘𝑓 + ↾ (𝐵 × 𝐵)) = (+g‘({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), ( ∘𝑓 + ↾ (𝐵 × 𝐵))⟩, ⟨(.r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥)(.r‘𝑅)(𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ 𝐵 ↦ (({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {𝑥}) ∘𝑓 (.r‘𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})))
67	16, 18, 66	3eqtr4d 2275	1 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → ✚ = ( ∘𝑓 + ↾ (𝐵 × 𝐵)))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2203  {crab 2524  Vcvv 2812   ∪ cun 3208   ⊆ wss 3210  {csn 3688  {ctp 3690  ⟨cop 3691   class class class wbr 4108   ↦ cmpt 4170   × cxp 4746  ^◡ccnv 4747   ↾ cres 4750   “ cima 4751   Fn wfn 5346  ‘cfv 5351  (class class class)co 6049   ∈ cmpo 6051   ∘_𝑓 cof 6263   ∘_𝑟 cofr 6264   ↑_𝑚 cmap 6881  Fincfn 6974  1c1 8127   ≤ cle 8308   − cmin 8443  ℕcn 9236  9c9 9294  ℕ₀cn0 9495  ndxcnx 13201  Basecbs 13204  +_gcplusg 13282  ._rcmulr 13283  Scalarcsca 13285   ·_𝑠 cvsca 13286  TopSetcts 13288  TopOpenctopn 13445  ∏_tcpt 13460   Σ_g cgsu 13462   mPwSer cmps 14801

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8217  ax-resscn 8218  ax-1cn 8219  ax-1re 8220  ax-icn 8221  ax-addcl 8222  ax-addrcl 8223  ax-mulcl 8224  ax-addcom 8226  ax-addass 8228  ax-distr 8230  ax-i2m1 8231  ax-0lt1 8232  ax-0id 8234  ax-rnegex 8235  ax-cnre 8237  ax-pre-ltirr 8238  ax-pre-ltwlin 8239  ax-pre-lttrn 8240  ax-pre-apti 8241  ax-pre-ltadd 8242

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-tp 3696  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-of 6265  df-1st 6333  df-2nd 6334  df-map 6883  df-ixp 6933  df-pnf 8309  df-mnf 8310  df-xr 8311  df-ltxr 8312  df-le 8313  df-sub 8445  df-neg 8446  df-inn 9237  df-2 9295  df-3 9296  df-4 9297  df-5 9298  df-6 9299  df-7 9300  df-8 9301  df-9 9302  df-n0 9496  df-z 9577  df-uz 9853  df-fz 10342  df-struct 13206  df-ndx 13207  df-slot 13208  df-base 13210  df-plusg 13295  df-mulr 13296  df-sca 13298  df-vsca 13299  df-tset 13301  df-rest 13446  df-topn 13447  df-topgen 13465  df-pt 13466  df-psr 14803

This theorem is referenced by:  psradd  14826