Metamath Proof Explorer


Theorem emcllem2

Description: Lemma for emcl . F is increasing, and G is decreasing. (Contributed by Mario Carneiro, 11-Jul-2014)

Ref Expression
Hypotheses emcl.1 ⊢ F = n ∈ ℕ ⟼ ∑ m = 1 n 1 m − log ⁡ n
emcl.2 ⊢ G = n ∈ ℕ ⟼ ∑ m = 1 n 1 m − log ⁡ n + 1
Assertion emcllem2 ⊢ N ∈ ℕ → F ⁡ N + 1 ≤ F ⁡ N ∧ G ⁡ N ≤ G ⁡ N + 1

Proof

Step Hyp Ref Expression
1 emcl.1 ⊢ F = n ∈ ℕ ⟼ ∑ m = 1 n 1 m − log ⁡ n
2 emcl.2 ⊢ G = n ∈ ℕ ⟼ ∑ m = 1 n 1 m − log ⁡ n + 1
3 peano2nn ⊢ N ∈ ℕ → N + 1 ∈ ℕ
4 3 nnrecred ⊢ N ∈ ℕ → 1 N + 1 ∈ ℝ
5 3 nnrpd ⊢ N ∈ ℕ → N + 1 ∈ ℝ +
6 5 relogcld ⊢ N ∈ ℕ → log ⁡ N + 1 ∈ ℝ
7 nnrp ⊢ N ∈ ℕ → N ∈ ℝ +
8 7 relogcld ⊢ N ∈ ℕ → log ⁡ N ∈ ℝ
9 6 8 resubcld ⊢ N ∈ ℕ → log ⁡ N + 1 − log ⁡ N ∈ ℝ
10 fzfid ⊢ N ∈ ℕ → 1 … N ∈ Fin
11 elfznn ⊢ m ∈ 1 … N → m ∈ ℕ
12 11 adantl ⊢ N ∈ ℕ ∧ m ∈ 1 … N → m ∈ ℕ
13 12 nnrecred ⊢ N ∈ ℕ ∧ m ∈ 1 … N → 1 m ∈ ℝ
14 10 13 fsumrecl ⊢ N ∈ ℕ → ∑ m = 1 N 1 m ∈ ℝ
15 5 rpreccld ⊢ N ∈ ℕ → 1 N + 1 ∈ ℝ +
16 15 rpge0d ⊢ N ∈ ℕ → 0 ≤ 1 N + 1
17 1div1e1 ⊢ 1 1 = 1
18 1re ⊢ 1 ∈ ℝ
19 ltaddrp ⊢ 1 ∈ ℝ ∧ N ∈ ℝ + → 1 < 1 + N
20 18 7 19 sylancr ⊢ N ∈ ℕ → 1 < 1 + N
21 ax-1cn ⊢ 1 ∈ ℂ
22 nncn ⊢ N ∈ ℕ → N ∈ ℂ
23 addcom ⊢ 1 ∈ ℂ ∧ N ∈ ℂ → 1 + N = N + 1
24 21 22 23 sylancr ⊢ N ∈ ℕ → 1 + N = N + 1
25 20 24 breqtrd ⊢ N ∈ ℕ → 1 < N + 1
26 17 25 eqbrtrid ⊢ N ∈ ℕ → 1 1 < N + 1
27 3 nnred ⊢ N ∈ ℕ → N + 1 ∈ ℝ
28 3 nngt0d ⊢ N ∈ ℕ → 0 < N + 1
29 0lt1 ⊢ 0 < 1
30 ltrec1 ⊢ 1 ∈ ℝ ∧ 0 < 1 ∧ N + 1 ∈ ℝ ∧ 0 < N + 1 → 1 1 < N + 1 ↔ 1 N + 1 < 1
31 18 29 30 mpanl12 ⊢ N + 1 ∈ ℝ ∧ 0 < N + 1 → 1 1 < N + 1 ↔ 1 N + 1 < 1
32 27 28 31 syl2anc ⊢ N ∈ ℕ → 1 1 < N + 1 ↔ 1 N + 1 < 1
33 26 32 mpbid ⊢ N ∈ ℕ → 1 N + 1 < 1
34 4 16 33 eflegeo ⊢ N ∈ ℕ → e 1 N + 1 ≤ 1 1 − 1 N + 1
35 27 recnd ⊢ N ∈ ℕ → N + 1 ∈ ℂ
36 nnne0 ⊢ N ∈ ℕ → N ≠ 0
37 3 nnne0d ⊢ N ∈ ℕ → N + 1 ≠ 0
38 22 35 36 37 recdivd ⊢ N ∈ ℕ → 1 N N + 1 = N + 1 N
39 1cnd ⊢ N ∈ ℕ → 1 ∈ ℂ
40 35 39 35 37 divsubdird ⊢ N ∈ ℕ → N + 1 - 1 N + 1 = N + 1 N + 1 − 1 N + 1
41 pncan ⊢ N ∈ ℂ ∧ 1 ∈ ℂ → N + 1 - 1 = N
42 22 21 41 sylancl ⊢ N ∈ ℕ → N + 1 - 1 = N
43 42 oveq1d ⊢ N ∈ ℕ → N + 1 - 1 N + 1 = N N + 1
44 35 37 dividd ⊢ N ∈ ℕ → N + 1 N + 1 = 1
45 44 oveq1d ⊢ N ∈ ℕ → N + 1 N + 1 − 1 N + 1 = 1 − 1 N + 1
46 40 43 45 3eqtr3rd ⊢ N ∈ ℕ → 1 − 1 N + 1 = N N + 1
47 46 oveq2d ⊢ N ∈ ℕ → 1 1 − 1 N + 1 = 1 N N + 1
48 5 7 rpdivcld ⊢ N ∈ ℕ → N + 1 N ∈ ℝ +
49 48 reeflogd ⊢ N ∈ ℕ → e log ⁡ N + 1 N = N + 1 N
50 38 47 49 3eqtr4d ⊢ N ∈ ℕ → 1 1 − 1 N + 1 = e log ⁡ N + 1 N
51 34 50 breqtrd ⊢ N ∈ ℕ → e 1 N + 1 ≤ e log ⁡ N + 1 N
52 5 7 relogdivd ⊢ N ∈ ℕ → log ⁡ N + 1 N = log ⁡ N + 1 − log ⁡ N
53 52 9 eqeltrd ⊢ N ∈ ℕ → log ⁡ N + 1 N ∈ ℝ
54 efle ⊢ 1 N + 1 ∈ ℝ ∧ log ⁡ N + 1 N ∈ ℝ → 1 N + 1 ≤ log ⁡ N + 1 N ↔ e 1 N + 1 ≤ e log ⁡ N + 1 N
55 4 53 54 syl2anc ⊢ N ∈ ℕ → 1 N + 1 ≤ log ⁡ N + 1 N ↔ e 1 N + 1 ≤ e log ⁡ N + 1 N
56 51 55 mpbird ⊢ N ∈ ℕ → 1 N + 1 ≤ log ⁡ N + 1 N
57 56 52 breqtrd ⊢ N ∈ ℕ → 1 N + 1 ≤ log ⁡ N + 1 − log ⁡ N
58 4 9 14 57 leadd2dd ⊢ N ∈ ℕ → ∑ m = 1 N 1 m + 1 N + 1 ≤ ∑ m = 1 N 1 m + log ⁡ N + 1 - log ⁡ N
59 id ⊢ N ∈ ℕ → N ∈ ℕ
60 nnuz ⊢ ℕ = ℤ ≥ 1
61 59 60 eleqtrdi ⊢ N ∈ ℕ → N ∈ ℤ ≥ 1
62 elfznn ⊢ m ∈ 1 … N + 1 → m ∈ ℕ
63 62 adantl ⊢ N ∈ ℕ ∧ m ∈ 1 … N + 1 → m ∈ ℕ
64 63 nnrecred ⊢ N ∈ ℕ ∧ m ∈ 1 … N + 1 → 1 m ∈ ℝ
65 64 recnd ⊢ N ∈ ℕ ∧ m ∈ 1 … N + 1 → 1 m ∈ ℂ
66 oveq2 ⊢ m = N + 1 → 1 m = 1 N + 1
67 61 65 66 fsump1 ⊢ N ∈ ℕ → ∑ m = 1 N + 1 1 m = ∑ m = 1 N 1 m + 1 N + 1
68 6 recnd ⊢ N ∈ ℕ → log ⁡ N + 1 ∈ ℂ
69 14 recnd ⊢ N ∈ ℕ → ∑ m = 1 N 1 m ∈ ℂ
70 8 recnd ⊢ N ∈ ℕ → log ⁡ N ∈ ℂ
71 68 69 70 addsub12d ⊢ N ∈ ℕ → log ⁡ N + 1 + ∑ m = 1 N 1 m - log ⁡ N = ∑ m = 1 N 1 m + log ⁡ N + 1 - log ⁡ N
72 58 67 71 3brtr4d ⊢ N ∈ ℕ → ∑ m = 1 N + 1 1 m ≤ log ⁡ N + 1 + ∑ m = 1 N 1 m - log ⁡ N
73 fzfid ⊢ N ∈ ℕ → 1 … N + 1 ∈ Fin
74 73 64 fsumrecl ⊢ N ∈ ℕ → ∑ m = 1 N + 1 1 m ∈ ℝ
75 14 8 resubcld ⊢ N ∈ ℕ → ∑ m = 1 N 1 m − log ⁡ N ∈ ℝ
76 74 6 75 lesubadd2d ⊢ N ∈ ℕ → ∑ m = 1 N + 1 1 m − log ⁡ N + 1 ≤ ∑ m = 1 N 1 m − log ⁡ N ↔ ∑ m = 1 N + 1 1 m ≤ log ⁡ N + 1 + ∑ m = 1 N 1 m - log ⁡ N
77 72 76 mpbird ⊢ N ∈ ℕ → ∑ m = 1 N + 1 1 m − log ⁡ N + 1 ≤ ∑ m = 1 N 1 m − log ⁡ N
78 oveq2 ⊢ n = N + 1 → 1 … n = 1 … N + 1
79 78 sumeq1d ⊢ n = N + 1 → ∑ m = 1 n 1 m = ∑ m = 1 N + 1 1 m
80 fveq2 ⊢ n = N + 1 → log ⁡ n = log ⁡ N + 1
81 79 80 oveq12d ⊢ n = N + 1 → ∑ m = 1 n 1 m − log ⁡ n = ∑ m = 1 N + 1 1 m − log ⁡ N + 1
82 ovex ⊢ ∑ m = 1 N + 1 1 m − log ⁡ N + 1 ∈ V
83 81 1 82 fvmpt ⊢ N + 1 ∈ ℕ → F ⁡ N + 1 = ∑ m = 1 N + 1 1 m − log ⁡ N + 1
84 3 83 syl ⊢ N ∈ ℕ → F ⁡ N + 1 = ∑ m = 1 N + 1 1 m − log ⁡ N + 1
85 oveq2 ⊢ n = N → 1 … n = 1 … N
86 85 sumeq1d ⊢ n = N → ∑ m = 1 n 1 m = ∑ m = 1 N 1 m
87 fveq2 ⊢ n = N → log ⁡ n = log ⁡ N
88 86 87 oveq12d ⊢ n = N → ∑ m = 1 n 1 m − log ⁡ n = ∑ m = 1 N 1 m − log ⁡ N
89 ovex ⊢ ∑ m = 1 N 1 m − log ⁡ N ∈ V
90 88 1 89 fvmpt ⊢ N ∈ ℕ → F ⁡ N = ∑ m = 1 N 1 m − log ⁡ N
91 77 84 90 3brtr4d ⊢ N ∈ ℕ → F ⁡ N + 1 ≤ F ⁡ N
92 peano2nn ⊢ N + 1 ∈ ℕ → N + 1 + 1 ∈ ℕ
93 3 92 syl ⊢ N ∈ ℕ → N + 1 + 1 ∈ ℕ
94 93 nnrpd ⊢ N ∈ ℕ → N + 1 + 1 ∈ ℝ +
95 94 relogcld ⊢ N ∈ ℕ → log ⁡ N + 1 + 1 ∈ ℝ
96 95 6 resubcld ⊢ N ∈ ℕ → log ⁡ N + 1 + 1 − log ⁡ N + 1 ∈ ℝ
97 logdifbnd ⊢ N + 1 ∈ ℝ + → log ⁡ N + 1 + 1 − log ⁡ N + 1 ≤ 1 N + 1
98 5 97 syl ⊢ N ∈ ℕ → log ⁡ N + 1 + 1 − log ⁡ N + 1 ≤ 1 N + 1
99 96 4 14 98 leadd2dd ⊢ N ∈ ℕ → ∑ m = 1 N 1 m + log ⁡ N + 1 + 1 - log ⁡ N + 1 ≤ ∑ m = 1 N 1 m + 1 N + 1
100 95 recnd ⊢ N ∈ ℕ → log ⁡ N + 1 + 1 ∈ ℂ
101 69 68 100 subadd23d ⊢ N ∈ ℕ → ∑ m = 1 N 1 m - log ⁡ N + 1 + log ⁡ N + 1 + 1 = ∑ m = 1 N 1 m + log ⁡ N + 1 + 1 - log ⁡ N + 1
102 99 101 67 3brtr4d ⊢ N ∈ ℕ → ∑ m = 1 N 1 m - log ⁡ N + 1 + log ⁡ N + 1 + 1 ≤ ∑ m = 1 N + 1 1 m
103 14 6 resubcld ⊢ N ∈ ℕ → ∑ m = 1 N 1 m − log ⁡ N + 1 ∈ ℝ
104 leaddsub ⊢ ∑ m = 1 N 1 m − log ⁡ N + 1 ∈ ℝ ∧ log ⁡ N + 1 + 1 ∈ ℝ ∧ ∑ m = 1 N + 1 1 m ∈ ℝ → ∑ m = 1 N 1 m - log ⁡ N + 1 + log ⁡ N + 1 + 1 ≤ ∑ m = 1 N + 1 1 m ↔ ∑ m = 1 N 1 m − log ⁡ N + 1 ≤ ∑ m = 1 N + 1 1 m − log ⁡ N + 1 + 1
105 103 95 74 104 syl3anc ⊢ N ∈ ℕ → ∑ m = 1 N 1 m - log ⁡ N + 1 + log ⁡ N + 1 + 1 ≤ ∑ m = 1 N + 1 1 m ↔ ∑ m = 1 N 1 m − log ⁡ N + 1 ≤ ∑ m = 1 N + 1 1 m − log ⁡ N + 1 + 1
106 102 105 mpbid ⊢ N ∈ ℕ → ∑ m = 1 N 1 m − log ⁡ N + 1 ≤ ∑ m = 1 N + 1 1 m − log ⁡ N + 1 + 1
107 fvoveq1 ⊢ n = N → log ⁡ n + 1 = log ⁡ N + 1
108 86 107 oveq12d ⊢ n = N → ∑ m = 1 n 1 m − log ⁡ n + 1 = ∑ m = 1 N 1 m − log ⁡ N + 1
109 ovex ⊢ ∑ m = 1 N 1 m − log ⁡ N + 1 ∈ V
110 108 2 109 fvmpt ⊢ N ∈ ℕ → G ⁡ N = ∑ m = 1 N 1 m − log ⁡ N + 1
111 fvoveq1 ⊢ n = N + 1 → log ⁡ n + 1 = log ⁡ N + 1 + 1
112 79 111 oveq12d ⊢ n = N + 1 → ∑ m = 1 n 1 m − log ⁡ n + 1 = ∑ m = 1 N + 1 1 m − log ⁡ N + 1 + 1
113 ovex ⊢ ∑ m = 1 N + 1 1 m − log ⁡ N + 1 + 1 ∈ V
114 112 2 113 fvmpt ⊢ N + 1 ∈ ℕ → G ⁡ N + 1 = ∑ m = 1 N + 1 1 m − log ⁡ N + 1 + 1
115 3 114 syl ⊢ N ∈ ℕ → G ⁡ N + 1 = ∑ m = 1 N + 1 1 m − log ⁡ N + 1 + 1
116 106 110 115 3brtr4d ⊢ N ∈ ℕ → G ⁡ N ≤ G ⁡ N + 1
117 91 116 jca ⊢ N ∈ ℕ → F ⁡ N + 1 ≤ F ⁡ N ∧ G ⁡ N ≤ G ⁡ N + 1