Metamath Proof Explorer


Theorem mdegvsca

Description: The degree of a scalar multiple of a polynomial is exactly the degree of the original polynomial when the multiple is a nonzero-divisor. (Contributed by Stefan O'Rear, 28-Mar-2015) (Proof shortened by AV, 27-Jul-2019)

Ref Expression
Hypotheses mdegaddle.y ⊢ Y = I mPoly R
mdegaddle.d ⊢ D = I mDeg R
mdegaddle.i ⊢ φ → I ∈ V
mdegaddle.r ⊢ φ → R ∈ Ring
mdegvsca.b ⊢ B = Base Y
mdegvsca.e ⊢ E = RLReg ⁡ R
mdegvsca.p ⊢ · ˙ = ⋅ Y
mdegvsca.f ⊢ φ → F ∈ E
mdegvsca.g ⊢ φ → G ∈ B
Assertion mdegvsca ⊢ φ → D ⁡ F · ˙ G = D ⁡ G

Proof

Step Hyp Ref Expression
1 mdegaddle.y ⊢ Y = I mPoly R
2 mdegaddle.d ⊢ D = I mDeg R
3 mdegaddle.i ⊢ φ → I ∈ V
4 mdegaddle.r ⊢ φ → R ∈ Ring
5 mdegvsca.b ⊢ B = Base Y
6 mdegvsca.e ⊢ E = RLReg ⁡ R
7 mdegvsca.p ⊢ · ˙ = ⋅ Y
8 mdegvsca.f ⊢ φ → F ∈ E
9 mdegvsca.g ⊢ φ → G ∈ B
10 eqid ⊢ Base R = Base R
11 eqid ⊢ ⋅ R = ⋅ R
12 eqid ⊢ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin = x ∈ ℕ 0 I | x -1 ℕ ∈ Fin
13 6 10 rrgss ⊢ E ⊆ Base R
14 13 8 sselid ⊢ φ → F ∈ Base R
15 1 7 10 5 11 12 14 9 mplvsca ⊢ φ → F · ˙ G = x ∈ ℕ 0 I | x -1 ℕ ∈ Fin × F ⋅ R f G
16 15 oveq1d ⊢ φ → F · ˙ G supp 0 R = x ∈ ℕ 0 I | x -1 ℕ ∈ Fin × F ⋅ R f G supp 0 R
17 eqid ⊢ 0 R = 0 R
18 ovex ⊢ ℕ 0 I ∈ V
19 18 rabex ⊢ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ∈ V
20 19 a1i ⊢ φ → x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ∈ V
21 1 10 5 12 9 mplelf ⊢ φ → G : x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟶ Base R
22 6 10 11 17 20 4 8 21 rrgsupp ⊢ φ → x ∈ ℕ 0 I | x -1 ℕ ∈ Fin × F ⋅ R f G supp 0 R = G supp 0 R
23 16 22 eqtrd ⊢ φ → F · ˙ G supp 0 R = G supp 0 R
24 23 imaeq2d ⊢ φ → y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F · ˙ G supp 0 R = y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y G supp 0 R
25 24 supeq1d ⊢ φ → sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F · ˙ G supp 0 R ℝ * < = sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y G supp 0 R ℝ * <
26 1 3 4 mpllmodd ⊢ φ → Y ∈ LMod
27 1 3 4 mplsca ⊢ φ → R = Scalar ⁡ Y
28 27 fveq2d ⊢ φ → Base R = Base Scalar ⁡ Y
29 14 28 eleqtrd ⊢ φ → F ∈ Base Scalar ⁡ Y
30 eqid ⊢ Scalar ⁡ Y = Scalar ⁡ Y
31 eqid ⊢ Base Scalar ⁡ Y = Base Scalar ⁡ Y
32 5 30 7 31 lmodvscl ⊢ Y ∈ LMod ∧ F ∈ Base Scalar ⁡ Y ∧ G ∈ B → F · ˙ G ∈ B
33 26 29 9 32 syl3anc ⊢ φ → F · ˙ G ∈ B
34 eqid ⊢ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y = y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y
35 2 1 5 17 12 34 mdegval ⊢ F · ˙ G ∈ B → D ⁡ F · ˙ G = sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F · ˙ G supp 0 R ℝ * <
36 33 35 syl ⊢ φ → D ⁡ F · ˙ G = sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F · ˙ G supp 0 R ℝ * <
37 2 1 5 17 12 34 mdegval ⊢ G ∈ B → D ⁡ G = sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y G supp 0 R ℝ * <
38 9 37 syl ⊢ φ → D ⁡ G = sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y G supp 0 R ℝ * <
39 25 36 38 3eqtr4d ⊢ φ → D ⁡ F · ˙ G = D ⁡ G