Metamath Proof Explorer


Theorem ftalem4

Description: Lemma for fta : Closure of the auxiliary variables for ftalem5 . (Contributed by Mario Carneiro, 20-Sep-2014) (Revised by AV, 28-Sep-2020)

Ref Expression
Hypotheses ftalem.1 ⊢ A = coeff ⁡ F
ftalem.2 ⊢ N = deg ⁡ F
ftalem.3 ⊢ φ → F ∈ Poly ⁡ S
ftalem.4 ⊢ φ → N ∈ ℕ
ftalem4.5 ⊢ φ → F ⁡ 0 ≠ 0
ftalem4.6 ⊢ K = inf n ∈ ℕ | A ⁡ n ≠ 0 ℝ <
ftalem4.7 ⊢ T = − F ⁡ 0 A ⁡ K 1 K
ftalem4.8 ⊢ U = F ⁡ 0 ∑ k = K + 1 N A ⁡ k ⁢ T k + 1
ftalem4.9 ⊢ X = if 1 ≤ U 1 U
Assertion ftalem4 ⊢ φ → K ∈ ℕ ∧ A ⁡ K ≠ 0 ∧ T ∈ ℂ ∧ U ∈ ℝ + ∧ X ∈ ℝ +

Proof

Step Hyp Ref Expression
1 ftalem.1 ⊢ A = coeff ⁡ F
2 ftalem.2 ⊢ N = deg ⁡ F
3 ftalem.3 ⊢ φ → F ∈ Poly ⁡ S
4 ftalem.4 ⊢ φ → N ∈ ℕ
5 ftalem4.5 ⊢ φ → F ⁡ 0 ≠ 0
6 ftalem4.6 ⊢ K = inf n ∈ ℕ | A ⁡ n ≠ 0 ℝ <
7 ftalem4.7 ⊢ T = − F ⁡ 0 A ⁡ K 1 K
8 ftalem4.8 ⊢ U = F ⁡ 0 ∑ k = K + 1 N A ⁡ k ⁢ T k + 1
9 ftalem4.9 ⊢ X = if 1 ≤ U 1 U
10 ssrab2 ⊢ n ∈ ℕ | A ⁡ n ≠ 0 ⊆ ℕ
11 nnuz ⊢ ℕ = ℤ ≥ 1
12 10 11 sseqtri ⊢ n ∈ ℕ | A ⁡ n ≠ 0 ⊆ ℤ ≥ 1
13 fveq2 ⊢ n = N → A ⁡ n = A ⁡ N
14 13 neeq1d ⊢ n = N → A ⁡ n ≠ 0 ↔ A ⁡ N ≠ 0
15 4 nnne0d ⊢ φ → N ≠ 0
16 2 1 dgreq0 ⊢ F ∈ Poly ⁡ S → F = 0 𝑝 ↔ A ⁡ N = 0
17 3 16 syl ⊢ φ → F = 0 𝑝 ↔ A ⁡ N = 0
18 fveq2 ⊢ F = 0 𝑝 → deg ⁡ F = deg ⁡ 0 𝑝
19 dgr0 ⊢ deg ⁡ 0 𝑝 = 0
20 18 19 eqtrdi ⊢ F = 0 𝑝 → deg ⁡ F = 0
21 2 20 eqtrid ⊢ F = 0 𝑝 → N = 0
22 17 21 biimtrrdi ⊢ φ → A ⁡ N = 0 → N = 0
23 22 necon3d ⊢ φ → N ≠ 0 → A ⁡ N ≠ 0
24 15 23 mpd ⊢ φ → A ⁡ N ≠ 0
25 14 4 24 elrabd ⊢ φ → N ∈ n ∈ ℕ | A ⁡ n ≠ 0
26 25 ne0d ⊢ φ → n ∈ ℕ | A ⁡ n ≠ 0 ≠ ∅
27 infssuzcl ⊢ n ∈ ℕ | A ⁡ n ≠ 0 ⊆ ℤ ≥ 1 ∧ n ∈ ℕ | A ⁡ n ≠ 0 ≠ ∅ → inf n ∈ ℕ | A ⁡ n ≠ 0 ℝ < ∈ n ∈ ℕ | A ⁡ n ≠ 0
28 12 26 27 sylancr ⊢ φ → inf n ∈ ℕ | A ⁡ n ≠ 0 ℝ < ∈ n ∈ ℕ | A ⁡ n ≠ 0
29 6 28 eqeltrid ⊢ φ → K ∈ n ∈ ℕ | A ⁡ n ≠ 0
30 fveq2 ⊢ n = K → A ⁡ n = A ⁡ K
31 30 neeq1d ⊢ n = K → A ⁡ n ≠ 0 ↔ A ⁡ K ≠ 0
32 31 elrab ⊢ K ∈ n ∈ ℕ | A ⁡ n ≠ 0 ↔ K ∈ ℕ ∧ A ⁡ K ≠ 0
33 29 32 sylib ⊢ φ → K ∈ ℕ ∧ A ⁡ K ≠ 0
34 plyf ⊢ F ∈ Poly ⁡ S → F : ℂ ⟶ ℂ
35 3 34 syl ⊢ φ → F : ℂ ⟶ ℂ
36 0cn ⊢ 0 ∈ ℂ
37 ffvelcdm ⊢ F : ℂ ⟶ ℂ ∧ 0 ∈ ℂ → F ⁡ 0 ∈ ℂ
38 35 36 37 sylancl ⊢ φ → F ⁡ 0 ∈ ℂ
39 1 coef3 ⊢ F ∈ Poly ⁡ S → A : ℕ 0 ⟶ ℂ
40 3 39 syl ⊢ φ → A : ℕ 0 ⟶ ℂ
41 33 simpld ⊢ φ → K ∈ ℕ
42 41 nnnn0d ⊢ φ → K ∈ ℕ 0
43 40 42 ffvelcdmd ⊢ φ → A ⁡ K ∈ ℂ
44 33 simprd ⊢ φ → A ⁡ K ≠ 0
45 38 43 44 divcld ⊢ φ → F ⁡ 0 A ⁡ K ∈ ℂ
46 45 negcld ⊢ φ → − F ⁡ 0 A ⁡ K ∈ ℂ
47 41 nnrecred ⊢ φ → 1 K ∈ ℝ
48 47 recnd ⊢ φ → 1 K ∈ ℂ
49 46 48 cxpcld ⊢ φ → − F ⁡ 0 A ⁡ K 1 K ∈ ℂ
50 7 49 eqeltrid ⊢ φ → T ∈ ℂ
51 38 5 absrpcld ⊢ φ → F ⁡ 0 ∈ ℝ +
52 fzfid ⊢ φ → K + 1 … N ∈ Fin
53 peano2nn0 ⊢ K ∈ ℕ 0 → K + 1 ∈ ℕ 0
54 42 53 syl ⊢ φ → K + 1 ∈ ℕ 0
55 elfzuz ⊢ k ∈ K + 1 … N → k ∈ ℤ ≥ K + 1
56 eluznn0 ⊢ K + 1 ∈ ℕ 0 ∧ k ∈ ℤ ≥ K + 1 → k ∈ ℕ 0
57 54 55 56 syl2an ⊢ φ ∧ k ∈ K + 1 … N → k ∈ ℕ 0
58 40 ffvelcdmda ⊢ φ ∧ k ∈ ℕ 0 → A ⁡ k ∈ ℂ
59 57 58 syldan ⊢ φ ∧ k ∈ K + 1 … N → A ⁡ k ∈ ℂ
60 expcl ⊢ T ∈ ℂ ∧ k ∈ ℕ 0 → T k ∈ ℂ
61 50 57 60 syl2an2r ⊢ φ ∧ k ∈ K + 1 … N → T k ∈ ℂ
62 59 61 mulcld ⊢ φ ∧ k ∈ K + 1 … N → A ⁡ k ⁢ T k ∈ ℂ
63 62 abscld ⊢ φ ∧ k ∈ K + 1 … N → A ⁡ k ⁢ T k ∈ ℝ
64 52 63 fsumrecl ⊢ φ → ∑ k = K + 1 N A ⁡ k ⁢ T k ∈ ℝ
65 62 absge0d ⊢ φ ∧ k ∈ K + 1 … N → 0 ≤ A ⁡ k ⁢ T k
66 52 63 65 fsumge0 ⊢ φ → 0 ≤ ∑ k = K + 1 N A ⁡ k ⁢ T k
67 64 66 ge0p1rpd ⊢ φ → ∑ k = K + 1 N A ⁡ k ⁢ T k + 1 ∈ ℝ +
68 51 67 rpdivcld ⊢ φ → F ⁡ 0 ∑ k = K + 1 N A ⁡ k ⁢ T k + 1 ∈ ℝ +
69 8 68 eqeltrid ⊢ φ → U ∈ ℝ +
70 1rp ⊢ 1 ∈ ℝ +
71 ifcl ⊢ 1 ∈ ℝ + ∧ U ∈ ℝ + → if 1 ≤ U 1 U ∈ ℝ +
72 70 69 71 sylancr ⊢ φ → if 1 ≤ U 1 U ∈ ℝ +
73 9 72 eqeltrid ⊢ φ → X ∈ ℝ +
74 50 69 73 3jca ⊢ φ → T ∈ ℂ ∧ U ∈ ℝ + ∧ X ∈ ℝ +
75 33 74 jca ⊢ φ → K ∈ ℕ ∧ A ⁡ K ≠ 0 ∧ T ∈ ℂ ∧ U ∈ ℝ + ∧ X ∈ ℝ +