Metamath Proof Explorer


Theorem lmnn

Description: A condition that implies convergence. (Contributed by NM, 8-Jun-2007) (Revised by Mario Carneiro, 1-May-2014)

Ref Expression
Hypotheses lmnn.2 ⊢ J = MetOpen ⁡ D
lmnn.3 ⊢ φ → D ∈ ∞Met ⁡ X
lmnn.4 ⊢ φ → P ∈ X
lmnn.5 ⊢ φ → F : ℕ ⟶ X
lmnn.6 ⊢ φ ∧ k ∈ ℕ → F ⁡ k D P < 1 k
Assertion lmnn ⊢ φ → F ⇝t ⁡ J P

Proof

Step Hyp Ref Expression
1 lmnn.2 ⊢ J = MetOpen ⁡ D
2 lmnn.3 ⊢ φ → D ∈ ∞Met ⁡ X
3 lmnn.4 ⊢ φ → P ∈ X
4 lmnn.5 ⊢ φ → F : ℕ ⟶ X
5 lmnn.6 ⊢ φ ∧ k ∈ ℕ → F ⁡ k D P < 1 k
6 rpreccl ⊢ x ∈ ℝ + → 1 x ∈ ℝ +
7 6 adantl ⊢ φ ∧ x ∈ ℝ + → 1 x ∈ ℝ +
8 7 rpred ⊢ φ ∧ x ∈ ℝ + → 1 x ∈ ℝ
9 7 rpge0d ⊢ φ ∧ x ∈ ℝ + → 0 ≤ 1 x
10 flge0nn0 ⊢ 1 x ∈ ℝ ∧ 0 ≤ 1 x → 1 x ∈ ℕ 0
11 8 9 10 syl2anc ⊢ φ ∧ x ∈ ℝ + → 1 x ∈ ℕ 0
12 nn0p1nn ⊢ 1 x ∈ ℕ 0 → 1 x + 1 ∈ ℕ
13 11 12 syl ⊢ φ ∧ x ∈ ℝ + → 1 x + 1 ∈ ℕ
14 2 ad2antrr ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → D ∈ ∞Met ⁡ X
15 4 ad2antrr ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → F : ℕ ⟶ X
16 eluznn ⊢ 1 x + 1 ∈ ℕ ∧ k ∈ ℤ ≥ 1 x + 1 → k ∈ ℕ
17 13 16 sylan ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → k ∈ ℕ
18 15 17 ffvelcdmd ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → F ⁡ k ∈ X
19 3 ad2antrr ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → P ∈ X
20 xmetcl ⊢ D ∈ ∞Met ⁡ X ∧ F ⁡ k ∈ X ∧ P ∈ X → F ⁡ k D P ∈ ℝ *
21 14 18 19 20 syl3anc ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → F ⁡ k D P ∈ ℝ *
22 17 nnrecred ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 k ∈ ℝ
23 22 rexrd ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 k ∈ ℝ *
24 rpxr ⊢ x ∈ ℝ + → x ∈ ℝ *
25 24 ad2antlr ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → x ∈ ℝ *
26 5 adantlr ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℕ → F ⁡ k D P < 1 k
27 17 26 syldan ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → F ⁡ k D P < 1 k
28 8 adantr ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 x ∈ ℝ
29 13 nnred ⊢ φ ∧ x ∈ ℝ + → 1 x + 1 ∈ ℝ
30 29 adantr ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 x + 1 ∈ ℝ
31 17 nnred ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → k ∈ ℝ
32 flltp1 ⊢ 1 x ∈ ℝ → 1 x < 1 x + 1
33 28 32 syl ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 x < 1 x + 1
34 eluzle ⊢ k ∈ ℤ ≥ 1 x + 1 → 1 x + 1 ≤ k
35 34 adantl ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 x + 1 ≤ k
36 28 30 31 33 35 ltletrd ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 x < k
37 simplr ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → x ∈ ℝ +
38 rpregt0 ⊢ x ∈ ℝ + → x ∈ ℝ ∧ 0 < x
39 nnrp ⊢ k ∈ ℕ → k ∈ ℝ +
40 39 rpregt0d ⊢ k ∈ ℕ → k ∈ ℝ ∧ 0 < k
41 ltrec1 ⊢ x ∈ ℝ ∧ 0 < x ∧ k ∈ ℝ ∧ 0 < k → 1 x < k ↔ 1 k < x
42 38 40 41 syl2an ⊢ x ∈ ℝ + ∧ k ∈ ℕ → 1 x < k ↔ 1 k < x
43 37 17 42 syl2anc ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 x < k ↔ 1 k < x
44 36 43 mpbid ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → 1 k < x
45 21 23 25 27 44 xrlttrd ⊢ φ ∧ x ∈ ℝ + ∧ k ∈ ℤ ≥ 1 x + 1 → F ⁡ k D P < x
46 45 ralrimiva ⊢ φ ∧ x ∈ ℝ + → ∀ k ∈ ℤ ≥ 1 x + 1 F ⁡ k D P < x
47 fveq2 ⊢ j = 1 x + 1 → ℤ ≥ j = ℤ ≥ 1 x + 1
48 47 raleqdv ⊢ j = 1 x + 1 → ∀ k ∈ ℤ ≥ j F ⁡ k D P < x ↔ ∀ k ∈ ℤ ≥ 1 x + 1 F ⁡ k D P < x
49 48 rspcev ⊢ 1 x + 1 ∈ ℕ ∧ ∀ k ∈ ℤ ≥ 1 x + 1 F ⁡ k D P < x → ∃ j ∈ ℕ ∀ k ∈ ℤ ≥ j F ⁡ k D P < x
50 13 46 49 syl2anc ⊢ φ ∧ x ∈ ℝ + → ∃ j ∈ ℕ ∀ k ∈ ℤ ≥ j F ⁡ k D P < x
51 50 ralrimiva ⊢ φ → ∀ x ∈ ℝ + ∃ j ∈ ℕ ∀ k ∈ ℤ ≥ j F ⁡ k D P < x
52 nnuz ⊢ ℕ = ℤ ≥ 1
53 1zzd ⊢ φ → 1 ∈ ℤ
54 eqidd ⊢ φ ∧ k ∈ ℕ → F ⁡ k = F ⁡ k
55 1 2 52 53 54 4 lmmbrf ⊢ φ → F ⇝t ⁡ J P ↔ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ ℕ ∀ k ∈ ℤ ≥ j F ⁡ k D P < x
56 3 51 55 mpbir2and ⊢ φ → F ⇝t ⁡ J P