Metamath Proof Explorer


Theorem mplgsum

Description: Finite commutative sums of polynomials are taken componentwise. (Contributed by Thierry Arnoux, 16-Mar-2026)

Ref Expression
Hypotheses mplgsum.p ⊢ P = I mPoly R
mplgsum.b ⊢ B = Base P
mplgsum.r ⊢ φ → R ∈ Ring
mplgsum.i ⊢ φ → I ∈ V
mplgsum.d ⊢ D = h ∈ ℕ 0 I | finSupp 0 ⁡ h
mplgsum.a ⊢ φ → A ∈ Fin
mplgsum.f ⊢ φ → F : A ⟶ B
Assertion mplgsum ⊢ φ → ∑ P F = y ∈ D ⟼ ∑ R k ∈ A F ⁡ k ⁡ y

Proof

Step Hyp Ref Expression
1 mplgsum.p ⊢ P = I mPoly R
2 mplgsum.b ⊢ B = Base P
3 mplgsum.r ⊢ φ → R ∈ Ring
4 mplgsum.i ⊢ φ → I ∈ V
5 mplgsum.d ⊢ D = h ∈ ℕ 0 I | finSupp 0 ⁡ h
6 mplgsum.a ⊢ φ → A ∈ Fin
7 mplgsum.f ⊢ φ → F : A ⟶ B
8 eqid ⊢ Base I mPwSer R = Base I mPwSer R
9 eqid ⊢ + I mPwSer R = + I mPwSer R
10 eqid ⊢ I mPwSer R = I mPwSer R
11 1 10 2 mplval2 ⊢ P = I mPwSer R ↾ 𝑠 B
12 ovexd ⊢ φ → I mPwSer R ∈ V
13 1 10 2 8 mplbasss ⊢ B ⊆ Base I mPwSer R
14 13 a1i ⊢ φ → B ⊆ Base I mPwSer R
15 3 ringgrpd ⊢ φ → R ∈ Grp
16 5 psrbasfsupp ⊢ D = h ∈ ℕ 0 I | h -1 ℕ ∈ Fin
17 eqid ⊢ 0 R = 0 R
18 eqid ⊢ 0 I mPwSer R = 0 I mPwSer R
19 10 4 15 16 17 18 psr0 ⊢ φ → 0 I mPwSer R = D × 0 R
20 eqid ⊢ 0 P = 0 P
21 1 16 17 20 4 15 mpl0 ⊢ φ → 0 P = D × 0 R
22 19 21 eqtr4d ⊢ φ → 0 I mPwSer R = 0 P
23 1 mplgrp ⊢ I ∈ V ∧ R ∈ Grp → P ∈ Grp
24 4 15 23 syl2anc ⊢ φ → P ∈ Grp
25 2 20 grpidcl ⊢ P ∈ Grp → 0 P ∈ B
26 24 25 syl ⊢ φ → 0 P ∈ B
27 22 26 eqeltrd ⊢ φ → 0 I mPwSer R ∈ B
28 10 4 15 psrgrp ⊢ φ → I mPwSer R ∈ Grp
29 28 adantr ⊢ φ ∧ x ∈ Base I mPwSer R → I mPwSer R ∈ Grp
30 simpr ⊢ φ ∧ x ∈ Base I mPwSer R → x ∈ Base I mPwSer R
31 8 9 18 29 30 grplidd ⊢ φ ∧ x ∈ Base I mPwSer R → 0 I mPwSer R + I mPwSer R x = x
32 8 9 18 29 30 grpridd ⊢ φ ∧ x ∈ Base I mPwSer R → x + I mPwSer R 0 I mPwSer R = x
33 31 32 jca ⊢ φ ∧ x ∈ Base I mPwSer R → 0 I mPwSer R + I mPwSer R x = x ∧ x + I mPwSer R 0 I mPwSer R = x
34 8 9 11 12 6 14 7 27 33 gsumress ⊢ φ → ∑ I mPwSer R F = ∑ P F
35 7 14 fssd ⊢ φ → F : A ⟶ Base I mPwSer R
36 10 8 3 4 5 6 35 psrgsum ⊢ φ → ∑ I mPwSer R F = y ∈ D ⟼ ∑ R k ∈ A F ⁡ k ⁡ y
37 34 36 eqtr3d ⊢ φ → ∑ P F = y ∈ D ⟼ ∑ R k ∈ A F ⁡ k ⁡ y