Metamath Proof Explorer


Theorem explecnv

Description: A sequence of terms converges to zero when it is less than powers of a number A whose absolute value is less than 1. (Contributed by NM, 19-Jul-2008) (Revised by Mario Carneiro, 26-Apr-2014)

Ref Expression
Hypotheses explecnv.1 ⊢ Z = ℤ ≥ M
explecnv.2 ⊢ φ → F ∈ V
explecnv.3 ⊢ φ → M ∈ ℤ
explecnv.5 ⊢ φ → A ∈ ℝ
explecnv.4 ⊢ φ → A < 1
explecnv.6 ⊢ φ ∧ k ∈ Z → F ⁡ k ∈ ℂ
explecnv.7 ⊢ φ ∧ k ∈ Z → F ⁡ k ≤ A k
Assertion explecnv ⊢ φ → F ⇝ 0

Proof

Step Hyp Ref Expression
1 explecnv.1 ⊢ Z = ℤ ≥ M
2 explecnv.2 ⊢ φ → F ∈ V
3 explecnv.3 ⊢ φ → M ∈ ℤ
4 explecnv.5 ⊢ φ → A ∈ ℝ
5 explecnv.4 ⊢ φ → A < 1
6 explecnv.6 ⊢ φ ∧ k ∈ Z → F ⁡ k ∈ ℂ
7 explecnv.7 ⊢ φ ∧ k ∈ Z → F ⁡ k ≤ A k
8 eqid ⊢ ℤ ≥ if M ≤ 0 0 M = ℤ ≥ if M ≤ 0 0 M
9 0z ⊢ 0 ∈ ℤ
10 ifcl ⊢ 0 ∈ ℤ ∧ M ∈ ℤ → if M ≤ 0 0 M ∈ ℤ
11 9 3 10 sylancr ⊢ φ → if M ≤ 0 0 M ∈ ℤ
12 4 recnd ⊢ φ → A ∈ ℂ
13 12 5 expcnv ⊢ φ → n ∈ ℕ 0 ⟼ A n ⇝ 0
14 1 fvexi ⊢ Z ∈ V
15 14 mptex ⊢ n ∈ Z ⟼ F ⁡ n ∈ V
16 15 a1i ⊢ φ → n ∈ Z ⟼ F ⁡ n ∈ V
17 nn0uz ⊢ ℕ 0 = ℤ ≥ 0
18 1 17 ineq12i ⊢ Z ∩ ℕ 0 = ℤ ≥ M ∩ ℤ ≥ 0
19 uzin ⊢ M ∈ ℤ ∧ 0 ∈ ℤ → ℤ ≥ M ∩ ℤ ≥ 0 = ℤ ≥ if M ≤ 0 0 M
20 3 9 19 sylancl ⊢ φ → ℤ ≥ M ∩ ℤ ≥ 0 = ℤ ≥ if M ≤ 0 0 M
21 18 20 eqtr2id ⊢ φ → ℤ ≥ if M ≤ 0 0 M = Z ∩ ℕ 0
22 21 eleq2d ⊢ φ → k ∈ ℤ ≥ if M ≤ 0 0 M ↔ k ∈ Z ∩ ℕ 0
23 22 biimpa ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → k ∈ Z ∩ ℕ 0
24 23 elin2d ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → k ∈ ℕ 0
25 oveq2 ⊢ n = k → A n = A k
26 eqid ⊢ n ∈ ℕ 0 ⟼ A n = n ∈ ℕ 0 ⟼ A n
27 ovex ⊢ A k ∈ V
28 25 26 27 fvmpt ⊢ k ∈ ℕ 0 → n ∈ ℕ 0 ⟼ A n ⁡ k = A k
29 24 28 syl ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → n ∈ ℕ 0 ⟼ A n ⁡ k = A k
30 4 adantr ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → A ∈ ℝ
31 30 24 reexpcld ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → A k ∈ ℝ
32 29 31 eqeltrd ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → n ∈ ℕ 0 ⟼ A n ⁡ k ∈ ℝ
33 23 elin1d ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → k ∈ Z
34 2fveq3 ⊢ n = k → F ⁡ n = F ⁡ k
35 eqid ⊢ n ∈ Z ⟼ F ⁡ n = n ∈ Z ⟼ F ⁡ n
36 fvex ⊢ F ⁡ k ∈ V
37 34 35 36 fvmpt ⊢ k ∈ Z → n ∈ Z ⟼ F ⁡ n ⁡ k = F ⁡ k
38 33 37 syl ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → n ∈ Z ⟼ F ⁡ n ⁡ k = F ⁡ k
39 33 6 syldan ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → F ⁡ k ∈ ℂ
40 39 abscld ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → F ⁡ k ∈ ℝ
41 38 40 eqeltrd ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → n ∈ Z ⟼ F ⁡ n ⁡ k ∈ ℝ
42 33 7 syldan ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → F ⁡ k ≤ A k
43 42 38 29 3brtr4d ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → n ∈ Z ⟼ F ⁡ n ⁡ k ≤ n ∈ ℕ 0 ⟼ A n ⁡ k
44 39 absge0d ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → 0 ≤ F ⁡ k
45 44 38 breqtrrd ⊢ φ ∧ k ∈ ℤ ≥ if M ≤ 0 0 M → 0 ≤ n ∈ Z ⟼ F ⁡ n ⁡ k
46 8 11 13 16 32 41 43 45 climsqz2 ⊢ φ → n ∈ Z ⟼ F ⁡ n ⇝ 0
47 37 adantl ⊢ φ ∧ k ∈ Z → n ∈ Z ⟼ F ⁡ n ⁡ k = F ⁡ k
48 1 3 2 16 6 47 climabs0 ⊢ φ → F ⇝ 0 ↔ n ∈ Z ⟼ F ⁡ n ⇝ 0
49 46 48 mpbird ⊢ φ → F ⇝ 0