Metamath Proof Explorer


Theorem mdegxrcl

Description: Closure of polynomial degree in the extended reals. (Contributed by Stefan O'Rear, 19-Mar-2015) (Proof shortened by AV, 27-Jul-2019)

Ref Expression
Hypotheses mdegxrcl.d ⊢ D = I mDeg R
mdegxrcl.p ⊢ P = I mPoly R
mdegxrcl.b ⊢ B = Base P
Assertion mdegxrcl ⊢ F ∈ B → D ⁡ F ∈ ℝ *

Proof

Step Hyp Ref Expression
1 mdegxrcl.d ⊢ D = I mDeg R
2 mdegxrcl.p ⊢ P = I mPoly R
3 mdegxrcl.b ⊢ B = Base P
4 eqid ⊢ 0 R = 0 R
5 eqid ⊢ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin = x ∈ ℕ 0 I | x -1 ℕ ∈ Fin
6 eqid ⊢ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y = y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y
7 1 2 3 4 5 6 mdegval ⊢ F ∈ B → D ⁡ F = sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F supp 0 R ℝ * <
8 imassrn ⊢ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F supp 0 R ⊆ ran ⁡ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y
9 5 6 tdeglem1 ⊢ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y : x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟶ ℕ 0
10 frn ⊢ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y : x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟶ ℕ 0 → ran ⁡ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y ⊆ ℕ 0
11 9 10 mp1i ⊢ F ∈ B → ran ⁡ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y ⊆ ℕ 0
12 nn0ssre ⊢ ℕ 0 ⊆ ℝ
13 ressxr ⊢ ℝ ⊆ ℝ *
14 12 13 sstri ⊢ ℕ 0 ⊆ ℝ *
15 11 14 sstrdi ⊢ F ∈ B → ran ⁡ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y ⊆ ℝ *
16 8 15 sstrid ⊢ F ∈ B → y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F supp 0 R ⊆ ℝ *
17 supxrcl ⊢ y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F supp 0 R ⊆ ℝ * → sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F supp 0 R ℝ * < ∈ ℝ *
18 16 17 syl ⊢ F ∈ B → sup y ∈ x ∈ ℕ 0 I | x -1 ℕ ∈ Fin ⟼ ∑ ℂ fld y F supp 0 R ℝ * < ∈ ℝ *
19 7 18 eqeltrd ⊢ F ∈ B → D ⁡ F ∈ ℝ *