Metamath Proof Explorer


Theorem mplmonprod

Description: Finite product of monomials. Here the function G maps a bag of variables to the corresponding monomial. (Contributed by Thierry Arnoux, 16-Mar-2026)

Ref Expression
Hypotheses mplmonprod.p ⊢ P = I mPoly R
mplmonprod.b ⊢ B = Base P
mplmonprod.r ⊢ φ → R ∈ CRing
mplmonprod.i ⊢ φ → I ∈ V
mplmonprod.d ⊢ D = h ∈ ℕ 0 I | finSupp 0 ⁡ h
mplmonprod.a ⊢ φ → A ∈ Fin
mplmonprod.f ⊢ φ → F : A ⟶ D
mplmonprod.1 ⊢ 1 ˙ = 1 R
mplmonprod.0 ⊢ 0 ˙ = 0 R
mplmonprod.m ⊢ M = mulGrp P
mplmonprod.g ⊢ G = y ∈ D ⟼ z ∈ D ⟼ if z = y 1 ˙ 0 ˙
Assertion mplmonprod ⊢ φ → ∑ M G ∘ F = G ⁡ i ∈ I ⟼ ∑ ℂ fld x ∈ A F ⁡ x ⁡ i

Proof

Step Hyp Ref Expression
1 mplmonprod.p ⊢ P = I mPoly R
2 mplmonprod.b ⊢ B = Base P
3 mplmonprod.r ⊢ φ → R ∈ CRing
4 mplmonprod.i ⊢ φ → I ∈ V
5 mplmonprod.d ⊢ D = h ∈ ℕ 0 I | finSupp 0 ⁡ h
6 mplmonprod.a ⊢ φ → A ∈ Fin
7 mplmonprod.f ⊢ φ → F : A ⟶ D
8 mplmonprod.1 ⊢ 1 ˙ = 1 R
9 mplmonprod.0 ⊢ 0 ˙ = 0 R
10 mplmonprod.m ⊢ M = mulGrp P
11 mplmonprod.g ⊢ G = y ∈ D ⟼ z ∈ D ⟼ if z = y 1 ˙ 0 ˙
12 eqid ⊢ mulGrp I mPwSer R = mulGrp I mPwSer R
13 eqid ⊢ Base I mPwSer R = Base I mPwSer R
14 12 13 mgpbas ⊢ Base I mPwSer R = Base mulGrp I mPwSer R
15 eqid ⊢ I mPwSer R = I mPwSer R
16 eqid ⊢ ⋅ P = ⋅ P
17 1 15 16 mplmulr ⊢ ⋅ P = ⋅ I mPwSer R
18 12 17 mgpplusg ⊢ ⋅ P = + mulGrp I mPwSer R
19 ovex ⊢ I mPwSer R ∈ V
20 2 fvexi ⊢ B ∈ V
21 1 15 2 mplval2 ⊢ P = I mPwSer R ↾ 𝑠 B
22 21 12 mgpress ⊢ I mPwSer R ∈ V ∧ B ∈ V → mulGrp I mPwSer R ↾ 𝑠 B = mulGrp P
23 19 20 22 mp2an ⊢ mulGrp I mPwSer R ↾ 𝑠 B = mulGrp P
24 10 23 eqtr4i ⊢ M = mulGrp I mPwSer R ↾ 𝑠 B
25 fvexd ⊢ φ → mulGrp I mPwSer R ∈ V
26 1 15 2 13 mplbasss ⊢ B ⊆ Base I mPwSer R
27 26 a1i ⊢ φ → B ⊆ Base I mPwSer R
28 fvexd ⊢ φ ∧ y ∈ D → Base R ∈ V
29 ovex ⊢ ℕ 0 I ∈ V
30 5 29 rabex2 ⊢ D ∈ V
31 30 a1i ⊢ φ ∧ y ∈ D → D ∈ V
32 eqid ⊢ Base R = Base R
33 3 crngringd ⊢ φ → R ∈ Ring
34 32 8 33 ringidcld ⊢ φ → 1 ˙ ∈ Base R
35 3 crnggrpd ⊢ φ → R ∈ Grp
36 32 9 grpidcl ⊢ R ∈ Grp → 0 ˙ ∈ Base R
37 35 36 syl ⊢ φ → 0 ˙ ∈ Base R
38 34 37 ifcld ⊢ φ → if z = y 1 ˙ 0 ˙ ∈ Base R
39 38 ad2antrr ⊢ φ ∧ y ∈ D ∧ z ∈ D → if z = y 1 ˙ 0 ˙ ∈ Base R
40 eqid ⊢ z ∈ D ⟼ if z = y 1 ˙ 0 ˙ = z ∈ D ⟼ if z = y 1 ˙ 0 ˙
41 39 40 fmptd ⊢ φ ∧ y ∈ D → z ∈ D ⟼ if z = y 1 ˙ 0 ˙ : D ⟶ Base R
42 28 31 41 elmapdd ⊢ φ ∧ y ∈ D → z ∈ D ⟼ if z = y 1 ˙ 0 ˙ ∈ Base R D
43 5 psrbasfsupp ⊢ D = h ∈ ℕ 0 I | h -1 ℕ ∈ Fin
44 4 adantr ⊢ φ ∧ y ∈ D → I ∈ V
45 15 32 43 13 44 psrbas ⊢ φ ∧ y ∈ D → Base I mPwSer R = Base R D
46 42 45 eleqtrrd ⊢ φ ∧ y ∈ D → z ∈ D ⟼ if z = y 1 ˙ 0 ˙ ∈ Base I mPwSer R
47 velsn ⊢ z ∈ y ↔ z = y
48 47 bicomi ⊢ z = y ↔ z ∈ y
49 48 a1i ⊢ z ∈ D → z = y ↔ z ∈ y
50 49 ifbid ⊢ z ∈ D → if z = y 1 ˙ 0 ˙ = if z ∈ y 1 ˙ 0 ˙
51 50 mpteq2ia ⊢ z ∈ D ⟼ if z = y 1 ˙ 0 ˙ = z ∈ D ⟼ if z ∈ y 1 ˙ 0 ˙
52 snfi ⊢ y ∈ Fin
53 52 a1i ⊢ φ ∧ y ∈ D → y ∈ Fin
54 8 fvexi ⊢ 1 ˙ ∈ V
55 54 a1i ⊢ φ ∧ y ∈ D ∧ z ∈ y → 1 ˙ ∈ V
56 9 fvexi ⊢ 0 ˙ ∈ V
57 56 a1i ⊢ φ ∧ y ∈ D → 0 ˙ ∈ V
58 51 31 53 55 57 mptiffisupp ⊢ φ ∧ y ∈ D → finSupp 0 ˙⁡ z ∈ D ⟼ if z = y 1 ˙ 0 ˙
59 1 15 13 9 2 mplelbas ⊢ z ∈ D ⟼ if z = y 1 ˙ 0 ˙ ∈ B ↔ z ∈ D ⟼ if z = y 1 ˙ 0 ˙ ∈ Base I mPwSer R ∧ finSupp 0 ˙⁡ z ∈ D ⟼ if z = y 1 ˙ 0 ˙
60 46 58 59 sylanbrc ⊢ φ ∧ y ∈ D → z ∈ D ⟼ if z = y 1 ˙ 0 ˙ ∈ B
61 60 11 fmptd ⊢ φ → G : D ⟶ B
62 61 7 fcod ⊢ φ → G ∘ F : A ⟶ B
63 15 1 2 4 33 mplsubrg ⊢ φ → B ∈ SubRing ⁡ I mPwSer R
64 eqid ⊢ 1 I mPwSer R = 1 I mPwSer R
65 64 subrg1cl ⊢ B ∈ SubRing ⁡ I mPwSer R → 1 I mPwSer R ∈ B
66 63 65 syl ⊢ φ → 1 I mPwSer R ∈ B
67 15 4 33 psrring ⊢ φ → I mPwSer R ∈ Ring
68 67 adantr ⊢ φ ∧ x ∈ Base I mPwSer R → I mPwSer R ∈ Ring
69 simpr ⊢ φ ∧ x ∈ Base I mPwSer R → x ∈ Base I mPwSer R
70 13 17 64 68 69 ringlidmd ⊢ φ ∧ x ∈ Base I mPwSer R → 1 I mPwSer R ⋅ P x = x
71 13 17 64 68 69 ringridmd ⊢ φ ∧ x ∈ Base I mPwSer R → x ⋅ P 1 I mPwSer R = x
72 70 71 jca ⊢ φ ∧ x ∈ Base I mPwSer R → 1 I mPwSer R ⋅ P x = x ∧ x ⋅ P 1 I mPwSer R = x
73 14 18 24 25 6 27 62 66 72 gsumress ⊢ φ → ∑ mulGrp I mPwSer R G ∘ F = ∑ M G ∘ F
74 15 13 3 4 5 6 7 8 9 12 11 psrmonprod ⊢ φ → ∑ mulGrp I mPwSer R G ∘ F = G ⁡ i ∈ I ⟼ ∑ ℂ fld x ∈ A F ⁡ x ⁡ i
75 73 74 eqtr3d ⊢ φ → ∑ M G ∘ F = G ⁡ i ∈ I ⟼ ∑ ℂ fld x ∈ A F ⁡ x ⁡ i