Metamath Proof Explorer


Theorem stoweidlem7

Description: This lemma is used to prove that q_n as in the proof of Lemma 1 in BrosowskiDeutsh p. 91, (at the top of page 91), is such that q_n < ε on T \ U , and q_n > 1 - ε on V . Here it is proven that, for n large enough, 1-(k*δ/2)^n > 1 - ε , and 1/(k*δ)^n < ε. The variable A is used to represent (k*δ) in the paper, and B is used to represent (k*δ/2). (Contributed by Glauco Siliprandi, 20-Apr-2017)

Ref Expression
Hypotheses stoweidlem7.1 ⊢ F = i ∈ ℕ 0 ⟼ 1 A i
stoweidlem7.2 ⊢ G = i ∈ ℕ 0 ⟼ B i
stoweidlem7.3 ⊢ φ → A ∈ ℝ
stoweidlem7.4 ⊢ φ → 1 < A
stoweidlem7.5 ⊢ φ → B ∈ ℝ +
stoweidlem7.6 ⊢ φ → B < 1
stoweidlem7.7 ⊢ φ → E ∈ ℝ +
Assertion stoweidlem7 ⊢ φ → ∃ n ∈ ℕ 1 − E < 1 − B n ∧ 1 A n < E

Proof

Step Hyp Ref Expression
1 stoweidlem7.1 ⊢ F = i ∈ ℕ 0 ⟼ 1 A i
2 stoweidlem7.2 ⊢ G = i ∈ ℕ 0 ⟼ B i
3 stoweidlem7.3 ⊢ φ → A ∈ ℝ
4 stoweidlem7.4 ⊢ φ → 1 < A
5 stoweidlem7.5 ⊢ φ → B ∈ ℝ +
6 stoweidlem7.6 ⊢ φ → B < 1
7 stoweidlem7.7 ⊢ φ → E ∈ ℝ +
8 nnuz ⊢ ℕ = ℤ ≥ 1
9 1zzd ⊢ φ → 1 ∈ ℤ
10 oveq2 ⊢ i = k → B i = B k
11 nnnn0 ⊢ k ∈ ℕ → k ∈ ℕ 0
12 11 adantl ⊢ φ ∧ k ∈ ℕ → k ∈ ℕ 0
13 5 rpcnd ⊢ φ → B ∈ ℂ
14 13 adantr ⊢ φ ∧ k ∈ ℕ → B ∈ ℂ
15 14 12 expcld ⊢ φ ∧ k ∈ ℕ → B k ∈ ℂ
16 2 10 12 15 fvmptd3 ⊢ φ ∧ k ∈ ℕ → G ⁡ k = B k
17 1red ⊢ φ → 1 ∈ ℝ
18 17 renegcld ⊢ φ → − 1 ∈ ℝ
19 0red ⊢ φ → 0 ∈ ℝ
20 5 rpred ⊢ φ → B ∈ ℝ
21 neg1lt0 ⊢ − 1 < 0
22 21 a1i ⊢ φ → − 1 < 0
23 5 rpgt0d ⊢ φ → 0 < B
24 18 19 20 22 23 lttrd ⊢ φ → − 1 < B
25 20 17 absltd ⊢ φ → B < 1 ↔ − 1 < B ∧ B < 1
26 24 6 25 mpbir2and ⊢ φ → B < 1
27 13 26 expcnv ⊢ φ → i ∈ ℕ 0 ⟼ B i ⇝ 0
28 2 27 eqbrtrid ⊢ φ → G ⇝ 0
29 8 9 7 16 28 climi ⊢ φ → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E
30 r19.26 ⊢ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ↔ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ ∀ k ∈ ℤ ≥ n B k − 0 < E
31 30 simprbi ⊢ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E → ∀ k ∈ ℤ ≥ n B k − 0 < E
32 31 ad2antlr ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → ∀ k ∈ ℤ ≥ n B k − 0 < E
33 oveq2 ⊢ k = i → B k = B i
34 33 oveq1d ⊢ k = i → B k − 0 = B i − 0
35 34 fveq2d ⊢ k = i → B k − 0 = B i − 0
36 35 breq1d ⊢ k = i → B k − 0 < E ↔ B i − 0 < E
37 36 rspccva ⊢ ∀ k ∈ ℤ ≥ n B k − 0 < E ∧ i ∈ ℤ ≥ n → B i − 0 < E
38 32 37 sylancom ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → B i − 0 < E
39 simplll ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → φ
40 39 5 syl ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → B ∈ ℝ +
41 40 rpred ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → B ∈ ℝ
42 simpllr ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → n ∈ ℕ
43 nnnn0 ⊢ n ∈ ℕ → n ∈ ℕ 0
44 42 43 syl ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → n ∈ ℕ 0
45 eluznn0 ⊢ n ∈ ℕ 0 ∧ i ∈ ℤ ≥ n → i ∈ ℕ 0
46 44 45 sylancom ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → i ∈ ℕ 0
47 41 46 reexpcld ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → B i ∈ ℝ
48 rpre ⊢ E ∈ ℝ + → E ∈ ℝ
49 39 7 48 3syl ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → E ∈ ℝ
50 recn ⊢ B i ∈ ℝ → B i ∈ ℂ
51 50 subid1d ⊢ B i ∈ ℝ → B i − 0 = B i
52 51 adantr ⊢ B i ∈ ℝ ∧ E ∈ ℝ → B i − 0 = B i
53 52 fveq2d ⊢ B i ∈ ℝ ∧ E ∈ ℝ → B i − 0 = B i
54 53 breq1d ⊢ B i ∈ ℝ ∧ E ∈ ℝ → B i − 0 < E ↔ B i < E
55 abslt ⊢ B i ∈ ℝ ∧ E ∈ ℝ → B i < E ↔ − E < B i ∧ B i < E
56 54 55 bitrd ⊢ B i ∈ ℝ ∧ E ∈ ℝ → B i − 0 < E ↔ − E < B i ∧ B i < E
57 47 49 56 syl2anc ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → B i − 0 < E ↔ − E < B i ∧ B i < E
58 38 57 mpbid ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → − E < B i ∧ B i < E
59 58 simprd ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → B i < E
60 eluznn ⊢ n ∈ ℕ ∧ i ∈ ℤ ≥ n → i ∈ ℕ
61 42 60 sylancom ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → i ∈ ℕ
62 20 adantr ⊢ φ ∧ i ∈ ℕ → B ∈ ℝ
63 nnnn0 ⊢ i ∈ ℕ → i ∈ ℕ 0
64 63 adantl ⊢ φ ∧ i ∈ ℕ → i ∈ ℕ 0
65 62 64 reexpcld ⊢ φ ∧ i ∈ ℕ → B i ∈ ℝ
66 7 rpred ⊢ φ → E ∈ ℝ
67 66 adantr ⊢ φ ∧ i ∈ ℕ → E ∈ ℝ
68 1red ⊢ φ ∧ i ∈ ℕ → 1 ∈ ℝ
69 65 67 68 ltsub2d ⊢ φ ∧ i ∈ ℕ → B i < E ↔ 1 − E < 1 − B i
70 39 61 69 syl2anc ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → B i < E ↔ 1 − E < 1 − B i
71 59 70 mpbid ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E ∧ i ∈ ℤ ≥ n → 1 − E < 1 − B i
72 71 ralrimiva ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E → ∀ i ∈ ℤ ≥ n 1 − E < 1 − B i
73 33 oveq2d ⊢ k = i → 1 − B k = 1 − B i
74 73 breq2d ⊢ k = i → 1 − E < 1 − B k ↔ 1 − E < 1 − B i
75 74 cbvralvw ⊢ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ↔ ∀ i ∈ ℤ ≥ n 1 − E < 1 − B i
76 72 75 sylibr ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E → ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k
77 76 ex ⊢ φ ∧ n ∈ ℕ → ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E → ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k
78 77 reximdva ⊢ φ → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n B k ∈ ℂ ∧ B k − 0 < E → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k
79 29 78 mpd ⊢ φ → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k
80 oveq2 ⊢ i = k → 1 A i = 1 A k
81 3 recnd ⊢ φ → A ∈ ℂ
82 0lt1 ⊢ 0 < 1
83 82 a1i ⊢ φ → 0 < 1
84 19 17 3 83 4 lttrd ⊢ φ → 0 < A
85 84 gt0ne0d ⊢ φ → A ≠ 0
86 81 85 reccld ⊢ φ → 1 A ∈ ℂ
87 86 adantr ⊢ φ ∧ k ∈ ℕ → 1 A ∈ ℂ
88 87 12 expcld ⊢ φ ∧ k ∈ ℕ → 1 A k ∈ ℂ
89 1 80 12 88 fvmptd3 ⊢ φ ∧ k ∈ ℕ → F ⁡ k = 1 A k
90 3 85 rereccld ⊢ φ → 1 A ∈ ℝ
91 3 84 recgt0d ⊢ φ → 0 < 1 A
92 18 19 90 22 91 lttrd ⊢ φ → − 1 < 1 A
93 ltdiv23 ⊢ 1 ∈ ℝ ∧ A ∈ ℝ ∧ 0 < A ∧ 1 ∈ ℝ ∧ 0 < 1 → 1 A < 1 ↔ 1 1 < A
94 17 3 84 17 83 93 syl122anc ⊢ φ → 1 A < 1 ↔ 1 1 < A
95 1cnd ⊢ φ → 1 ∈ ℂ
96 95 div1d ⊢ φ → 1 1 = 1
97 96 breq1d ⊢ φ → 1 1 < A ↔ 1 < A
98 94 97 bitrd ⊢ φ → 1 A < 1 ↔ 1 < A
99 4 98 mpbird ⊢ φ → 1 A < 1
100 90 17 absltd ⊢ φ → 1 A < 1 ↔ − 1 < 1 A ∧ 1 A < 1
101 92 99 100 mpbir2and ⊢ φ → 1 A < 1
102 86 101 expcnv ⊢ φ → i ∈ ℕ 0 ⟼ 1 A i ⇝ 0
103 1 102 eqbrtrid ⊢ φ → F ⇝ 0
104 8 9 7 89 103 climi2 ⊢ φ → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 A k − 0 < E
105 simpll ⊢ φ ∧ n ∈ ℕ ∧ k ∈ ℤ ≥ n → φ
106 uznnssnn ⊢ n ∈ ℕ → ℤ ≥ n ⊆ ℕ
107 106 ad2antlr ⊢ φ ∧ n ∈ ℕ ∧ k ∈ ℤ ≥ n → ℤ ≥ n ⊆ ℕ
108 simpr ⊢ φ ∧ n ∈ ℕ ∧ k ∈ ℤ ≥ n → k ∈ ℤ ≥ n
109 107 108 sseldd ⊢ φ ∧ n ∈ ℕ ∧ k ∈ ℤ ≥ n → k ∈ ℕ
110 88 subid1d ⊢ φ ∧ k ∈ ℕ → 1 A k − 0 = 1 A k
111 110 fveq2d ⊢ φ ∧ k ∈ ℕ → 1 A k − 0 = 1 A k
112 90 adantr ⊢ φ ∧ k ∈ ℕ → 1 A ∈ ℝ
113 112 12 reexpcld ⊢ φ ∧ k ∈ ℕ → 1 A k ∈ ℝ
114 19 90 91 ltled ⊢ φ → 0 ≤ 1 A
115 114 adantr ⊢ φ ∧ k ∈ ℕ → 0 ≤ 1 A
116 112 12 115 expge0d ⊢ φ ∧ k ∈ ℕ → 0 ≤ 1 A k
117 113 116 absidd ⊢ φ ∧ k ∈ ℕ → 1 A k = 1 A k
118 111 117 eqtrd ⊢ φ ∧ k ∈ ℕ → 1 A k − 0 = 1 A k
119 118 breq1d ⊢ φ ∧ k ∈ ℕ → 1 A k − 0 < E ↔ 1 A k < E
120 119 biimpd ⊢ φ ∧ k ∈ ℕ → 1 A k − 0 < E → 1 A k < E
121 105 109 120 syl2anc ⊢ φ ∧ n ∈ ℕ ∧ k ∈ ℤ ≥ n → 1 A k − 0 < E → 1 A k < E
122 121 ralimdva ⊢ φ ∧ n ∈ ℕ → ∀ k ∈ ℤ ≥ n 1 A k − 0 < E → ∀ k ∈ ℤ ≥ n 1 A k < E
123 122 reximdva ⊢ φ → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 A k − 0 < E → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 A k < E
124 104 123 mpd ⊢ φ → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 A k < E
125 8 rexanuz2 ⊢ ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E ↔ ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 A k < E
126 79 124 125 sylanbrc ⊢ φ → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E
127 simpr ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E → ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E
128 nnz ⊢ n ∈ ℕ → n ∈ ℤ
129 uzid ⊢ n ∈ ℤ → n ∈ ℤ ≥ n
130 128 129 syl ⊢ n ∈ ℕ → n ∈ ℤ ≥ n
131 130 ad2antlr ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E → n ∈ ℤ ≥ n
132 oveq2 ⊢ k = n → B k = B n
133 132 oveq2d ⊢ k = n → 1 − B k = 1 − B n
134 133 breq2d ⊢ k = n → 1 − E < 1 − B k ↔ 1 − E < 1 − B n
135 oveq2 ⊢ k = n → 1 A k = 1 A n
136 135 breq1d ⊢ k = n → 1 A k < E ↔ 1 A n < E
137 134 136 anbi12d ⊢ k = n → 1 − E < 1 − B k ∧ 1 A k < E ↔ 1 − E < 1 − B n ∧ 1 A n < E
138 137 rspccva ⊢ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E ∧ n ∈ ℤ ≥ n → 1 − E < 1 − B n ∧ 1 A n < E
139 127 131 138 syl2anc ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E → 1 − E < 1 − B n ∧ 1 A n < E
140 1cnd ⊢ φ ∧ n ∈ ℕ → 1 ∈ ℂ
141 81 85 jca ⊢ φ → A ∈ ℂ ∧ A ≠ 0
142 141 adantr ⊢ φ ∧ n ∈ ℕ → A ∈ ℂ ∧ A ≠ 0
143 43 adantl ⊢ φ ∧ n ∈ ℕ → n ∈ ℕ 0
144 expdiv ⊢ 1 ∈ ℂ ∧ A ∈ ℂ ∧ A ≠ 0 ∧ n ∈ ℕ 0 → 1 A n = 1 n A n
145 140 142 143 144 syl3anc ⊢ φ ∧ n ∈ ℕ → 1 A n = 1 n A n
146 128 adantl ⊢ φ ∧ n ∈ ℕ → n ∈ ℤ
147 1exp ⊢ n ∈ ℤ → 1 n = 1
148 146 147 syl ⊢ φ ∧ n ∈ ℕ → 1 n = 1
149 148 oveq1d ⊢ φ ∧ n ∈ ℕ → 1 n A n = 1 A n
150 145 149 eqtrd ⊢ φ ∧ n ∈ ℕ → 1 A n = 1 A n
151 150 breq1d ⊢ φ ∧ n ∈ ℕ → 1 A n < E ↔ 1 A n < E
152 151 adantr ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E → 1 A n < E ↔ 1 A n < E
153 152 anbi2d ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E → 1 − E < 1 − B n ∧ 1 A n < E ↔ 1 − E < 1 − B n ∧ 1 A n < E
154 139 153 mpbid ⊢ φ ∧ n ∈ ℕ ∧ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E → 1 − E < 1 − B n ∧ 1 A n < E
155 154 ex ⊢ φ ∧ n ∈ ℕ → ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E → 1 − E < 1 − B n ∧ 1 A n < E
156 155 reximdva ⊢ φ → ∃ n ∈ ℕ ∀ k ∈ ℤ ≥ n 1 − E < 1 − B k ∧ 1 A k < E → ∃ n ∈ ℕ 1 − E < 1 − B n ∧ 1 A n < E
157 126 156 mpd ⊢ φ → ∃ n ∈ ℕ 1 − E < 1 − B n ∧ 1 A n < E