Metamath Proof Explorer


Theorem stirlinglem10

Description: A bound for any B(N)-B(N + 1) that will allow to find a lower bound for the whole B sequence. (Contributed by Glauco Siliprandi, 29-Jun-2017)

Ref Expression
Hypotheses stirlinglem10.1 ⊢ A = n ∈ ℕ ⟼ n ! 2 ⁢ n ⁢ n e n
stirlinglem10.2 ⊢ B = n ∈ ℕ ⟼ log ⁡ A ⁡ n
stirlinglem10.4 ⊢ K = k ∈ ℕ ⟼ 1 2 ⁢ k + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ k
stirlinglem10.5 ⊢ L = k ∈ ℕ ⟼ 1 2 ⋅ N + 1 2 k
Assertion stirlinglem10 ⊢ N ∈ ℕ → B ⁡ N − B ⁡ N + 1 ≤ 1 4 ⁢ 1 N ⁢ N + 1

Proof

Step Hyp Ref Expression
1 stirlinglem10.1 ⊢ A = n ∈ ℕ ⟼ n ! 2 ⁢ n ⁢ n e n
2 stirlinglem10.2 ⊢ B = n ∈ ℕ ⟼ log ⁡ A ⁡ n
3 stirlinglem10.4 ⊢ K = k ∈ ℕ ⟼ 1 2 ⁢ k + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ k
4 stirlinglem10.5 ⊢ L = k ∈ ℕ ⟼ 1 2 ⋅ N + 1 2 k
5 nnuz ⊢ ℕ = ℤ ≥ 1
6 1zzd ⊢ N ∈ ℕ → 1 ∈ ℤ
7 eqid ⊢ n ∈ ℕ ⟼ 1 + 2 ⁢ n 2 ⁢ log ⁡ n + 1 n − 1 = n ∈ ℕ ⟼ 1 + 2 ⁢ n 2 ⁢ log ⁡ n + 1 n − 1
8 1 2 7 3 stirlinglem9 ⊢ N ∈ ℕ → seq 1 + K ⇝ B ⁡ N − B ⁡ N + 1
9 2cnd ⊢ N ∈ ℕ → 2 ∈ ℂ
10 nncn ⊢ N ∈ ℕ → N ∈ ℂ
11 9 10 mulcld ⊢ N ∈ ℕ → 2 ⋅ N ∈ ℂ
12 1cnd ⊢ N ∈ ℕ → 1 ∈ ℂ
13 11 12 addcld ⊢ N ∈ ℕ → 2 ⋅ N + 1 ∈ ℂ
14 13 sqcld ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 ∈ ℂ
15 0red ⊢ N ∈ ℕ → 0 ∈ ℝ
16 1red ⊢ N ∈ ℕ → 1 ∈ ℝ
17 2re ⊢ 2 ∈ ℝ
18 17 a1i ⊢ N ∈ ℕ → 2 ∈ ℝ
19 nnre ⊢ N ∈ ℕ → N ∈ ℝ
20 18 19 remulcld ⊢ N ∈ ℕ → 2 ⋅ N ∈ ℝ
21 20 16 readdcld ⊢ N ∈ ℕ → 2 ⋅ N + 1 ∈ ℝ
22 0lt1 ⊢ 0 < 1
23 22 a1i ⊢ N ∈ ℕ → 0 < 1
24 2rp ⊢ 2 ∈ ℝ +
25 24 a1i ⊢ N ∈ ℕ → 2 ∈ ℝ +
26 nnrp ⊢ N ∈ ℕ → N ∈ ℝ +
27 25 26 rpmulcld ⊢ N ∈ ℕ → 2 ⋅ N ∈ ℝ +
28 16 27 ltaddrp2d ⊢ N ∈ ℕ → 1 < 2 ⋅ N + 1
29 15 16 21 23 28 lttrd ⊢ N ∈ ℕ → 0 < 2 ⋅ N + 1
30 29 gt0ne0d ⊢ N ∈ ℕ → 2 ⋅ N + 1 ≠ 0
31 2z ⊢ 2 ∈ ℤ
32 31 a1i ⊢ N ∈ ℕ → 2 ∈ ℤ
33 13 30 32 expne0d ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 ≠ 0
34 14 33 reccld ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 ∈ ℂ
35 16 renegcld ⊢ N ∈ ℕ → − 1 ∈ ℝ
36 21 resqcld ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 ∈ ℝ
37 36 33 rereccld ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 ∈ ℝ
38 1re ⊢ 1 ∈ ℝ
39 lt0neg2 ⊢ 1 ∈ ℝ → 0 < 1 ↔ − 1 < 0
40 38 39 ax-mp ⊢ 0 < 1 ↔ − 1 < 0
41 23 40 sylib ⊢ N ∈ ℕ → − 1 < 0
42 21 30 sqgt0d ⊢ N ∈ ℕ → 0 < 2 ⋅ N + 1 2
43 36 42 recgt0d ⊢ N ∈ ℕ → 0 < 1 2 ⋅ N + 1 2
44 35 15 37 41 43 lttrd ⊢ N ∈ ℕ → − 1 < 1 2 ⋅ N + 1 2
45 2nn ⊢ 2 ∈ ℕ
46 45 a1i ⊢ N ∈ ℕ → 2 ∈ ℕ
47 expgt1 ⊢ 2 ⋅ N + 1 ∈ ℝ ∧ 2 ∈ ℕ ∧ 1 < 2 ⋅ N + 1 → 1 < 2 ⋅ N + 1 2
48 21 46 28 47 syl3anc ⊢ N ∈ ℕ → 1 < 2 ⋅ N + 1 2
49 36 42 elrpd ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 ∈ ℝ +
50 49 recgt1d ⊢ N ∈ ℕ → 1 < 2 ⋅ N + 1 2 ↔ 1 2 ⋅ N + 1 2 < 1
51 48 50 mpbid ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 < 1
52 37 16 absltd ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 < 1 ↔ − 1 < 1 2 ⋅ N + 1 2 ∧ 1 2 ⋅ N + 1 2 < 1
53 44 51 52 mpbir2and ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 < 1
54 1nn0 ⊢ 1 ∈ ℕ 0
55 54 a1i ⊢ N ∈ ℕ → 1 ∈ ℕ 0
56 4 a1i ⊢ N ∈ ℕ ∧ j ∈ ℤ ≥ 1 → L = k ∈ ℕ ⟼ 1 2 ⋅ N + 1 2 k
57 simpr ⊢ N ∈ ℕ ∧ j ∈ ℤ ≥ 1 ∧ k = j → k = j
58 57 oveq2d ⊢ N ∈ ℕ ∧ j ∈ ℤ ≥ 1 ∧ k = j → 1 2 ⋅ N + 1 2 k = 1 2 ⋅ N + 1 2 j
59 elnnuz ⊢ j ∈ ℕ ↔ j ∈ ℤ ≥ 1
60 59 bilanri ⊢ N ∈ ℕ ∧ j ∈ ℤ ≥ 1 → j ∈ ℕ
61 34 adantr ⊢ N ∈ ℕ ∧ j ∈ ℤ ≥ 1 → 1 2 ⋅ N + 1 2 ∈ ℂ
62 60 nnnn0d ⊢ N ∈ ℕ ∧ j ∈ ℤ ≥ 1 → j ∈ ℕ 0
63 61 62 expcld ⊢ N ∈ ℕ ∧ j ∈ ℤ ≥ 1 → 1 2 ⋅ N + 1 2 j ∈ ℂ
64 56 58 60 63 fvmptd ⊢ N ∈ ℕ ∧ j ∈ ℤ ≥ 1 → L ⁡ j = 1 2 ⋅ N + 1 2 j
65 34 53 55 64 geolim2 ⊢ N ∈ ℕ → seq 1 + L ⇝ 1 2 ⋅ N + 1 2 1 1 − 1 2 ⋅ N + 1 2
66 34 exp1d ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 1 = 1 2 ⋅ N + 1 2
67 14 33 dividd ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 2 ⋅ N + 1 2 = 1
68 67 eqcomd ⊢ N ∈ ℕ → 1 = 2 ⋅ N + 1 2 2 ⋅ N + 1 2
69 68 oveq1d ⊢ N ∈ ℕ → 1 − 1 2 ⋅ N + 1 2 = 2 ⋅ N + 1 2 2 ⋅ N + 1 2 − 1 2 ⋅ N + 1 2
70 49 rpcnne0d ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 ∈ ℂ ∧ 2 ⋅ N + 1 2 ≠ 0
71 divsubdir ⊢ 2 ⋅ N + 1 2 ∈ ℂ ∧ 1 ∈ ℂ ∧ 2 ⋅ N + 1 2 ∈ ℂ ∧ 2 ⋅ N + 1 2 ≠ 0 → 2 ⋅ N + 1 2 − 1 2 ⋅ N + 1 2 = 2 ⋅ N + 1 2 2 ⋅ N + 1 2 − 1 2 ⋅ N + 1 2
72 14 12 70 71 syl3anc ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 − 1 2 ⋅ N + 1 2 = 2 ⋅ N + 1 2 2 ⋅ N + 1 2 − 1 2 ⋅ N + 1 2
73 ax-1cn ⊢ 1 ∈ ℂ
74 binom2 ⊢ 2 ⋅ N ∈ ℂ ∧ 1 ∈ ℂ → 2 ⋅ N + 1 2 = 2 ⋅ N 2 + 2 ⁢ 2 ⋅ N ⋅ 1 + 1 2
75 11 73 74 sylancl ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 = 2 ⋅ N 2 + 2 ⁢ 2 ⋅ N ⋅ 1 + 1 2
76 75 oveq1d ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 − 1 = 2 ⋅ N 2 + 2 ⁢ 2 ⋅ N ⋅ 1 + 1 2 - 1
77 9 10 sqmuld ⊢ N ∈ ℕ → 2 ⋅ N 2 = 2 2 ⁢ N 2
78 sq2 ⊢ 2 2 = 4
79 78 a1i ⊢ N ∈ ℕ → 2 2 = 4
80 79 oveq1d ⊢ N ∈ ℕ → 2 2 ⁢ N 2 = 4 ⁢ N 2
81 77 80 eqtrd ⊢ N ∈ ℕ → 2 ⋅ N 2 = 4 ⁢ N 2
82 11 mulridd ⊢ N ∈ ℕ → 2 ⋅ N ⋅ 1 = 2 ⋅ N
83 82 oveq2d ⊢ N ∈ ℕ → 2 ⁢ 2 ⋅ N ⋅ 1 = 2 ⁢ 2 ⋅ N
84 9 9 10 mulassd ⊢ N ∈ ℕ → 2 ⋅ 2 ⋅ N = 2 ⁢ 2 ⋅ N
85 2t2e4 ⊢ 2 ⋅ 2 = 4
86 85 a1i ⊢ N ∈ ℕ → 2 ⋅ 2 = 4
87 86 oveq1d ⊢ N ∈ ℕ → 2 ⋅ 2 ⋅ N = 4 ⋅ N
88 83 84 87 3eqtr2d ⊢ N ∈ ℕ → 2 ⁢ 2 ⋅ N ⋅ 1 = 4 ⋅ N
89 81 88 oveq12d ⊢ N ∈ ℕ → 2 ⋅ N 2 + 2 ⁢ 2 ⋅ N ⋅ 1 = 4 ⁢ N 2 + 4 ⋅ N
90 4cn ⊢ 4 ∈ ℂ
91 90 a1i ⊢ N ∈ ℕ → 4 ∈ ℂ
92 10 sqcld ⊢ N ∈ ℕ → N 2 ∈ ℂ
93 91 92 10 adddid ⊢ N ∈ ℕ → 4 ⁢ N 2 + N = 4 ⁢ N 2 + 4 ⋅ N
94 10 sqvald ⊢ N ∈ ℕ → N 2 = N ⋅ N
95 10 mulridd ⊢ N ∈ ℕ → N ⋅ 1 = N
96 95 eqcomd ⊢ N ∈ ℕ → N = N ⋅ 1
97 94 96 oveq12d ⊢ N ∈ ℕ → N 2 + N = N ⋅ N + N ⋅ 1
98 10 10 12 adddid ⊢ N ∈ ℕ → N ⁢ N + 1 = N ⋅ N + N ⋅ 1
99 97 98 eqtr4d ⊢ N ∈ ℕ → N 2 + N = N ⁢ N + 1
100 99 oveq2d ⊢ N ∈ ℕ → 4 ⁢ N 2 + N = 4 ⁢ N ⁢ N + 1
101 89 93 100 3eqtr2d ⊢ N ∈ ℕ → 2 ⋅ N 2 + 2 ⁢ 2 ⋅ N ⋅ 1 = 4 ⁢ N ⁢ N + 1
102 sq1 ⊢ 1 2 = 1
103 102 a1i ⊢ N ∈ ℕ → 1 2 = 1
104 101 103 oveq12d ⊢ N ∈ ℕ → 2 ⋅ N 2 + 2 ⁢ 2 ⋅ N ⋅ 1 + 1 2 = 4 ⁢ N ⁢ N + 1 + 1
105 104 oveq1d ⊢ N ∈ ℕ → 2 ⋅ N 2 + 2 ⁢ 2 ⋅ N ⋅ 1 + 1 2 - 1 = 4 ⁢ N ⁢ N + 1 + 1 - 1
106 10 12 addcld ⊢ N ∈ ℕ → N + 1 ∈ ℂ
107 10 106 mulcld ⊢ N ∈ ℕ → N ⁢ N + 1 ∈ ℂ
108 91 107 mulcld ⊢ N ∈ ℕ → 4 ⁢ N ⁢ N + 1 ∈ ℂ
109 108 12 pncand ⊢ N ∈ ℕ → 4 ⁢ N ⁢ N + 1 + 1 - 1 = 4 ⁢ N ⁢ N + 1
110 76 105 109 3eqtrd ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 − 1 = 4 ⁢ N ⁢ N + 1
111 110 oveq1d ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 − 1 2 ⋅ N + 1 2 = 4 ⁢ N ⁢ N + 1 2 ⋅ N + 1 2
112 69 72 111 3eqtr2d ⊢ N ∈ ℕ → 1 − 1 2 ⋅ N + 1 2 = 4 ⁢ N ⁢ N + 1 2 ⋅ N + 1 2
113 66 112 oveq12d ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 1 1 − 1 2 ⋅ N + 1 2 = 1 2 ⋅ N + 1 2 4 ⁢ N ⁢ N + 1 2 ⋅ N + 1 2
114 4pos ⊢ 0 < 4
115 114 a1i ⊢ N ∈ ℕ → 0 < 4
116 115 gt0ne0d ⊢ N ∈ ℕ → 4 ≠ 0
117 nnne0 ⊢ N ∈ ℕ → N ≠ 0
118 19 16 readdcld ⊢ N ∈ ℕ → N + 1 ∈ ℝ
119 nngt0 ⊢ N ∈ ℕ → 0 < N
120 19 ltp1d ⊢ N ∈ ℕ → N < N + 1
121 15 19 118 119 120 lttrd ⊢ N ∈ ℕ → 0 < N + 1
122 121 gt0ne0d ⊢ N ∈ ℕ → N + 1 ≠ 0
123 10 106 117 122 mulne0d ⊢ N ∈ ℕ → N ⁢ N + 1 ≠ 0
124 91 107 116 123 mulne0d ⊢ N ∈ ℕ → 4 ⁢ N ⁢ N + 1 ≠ 0
125 12 14 108 14 33 33 124 divdivdivd ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 4 ⁢ N ⁢ N + 1 2 ⋅ N + 1 2 = 1 ⁢ 2 ⋅ N + 1 2 2 ⋅ N + 1 2 ⁢ 4 ⁢ N ⁢ N + 1
126 12 14 mulcomd ⊢ N ∈ ℕ → 1 ⁢ 2 ⋅ N + 1 2 = 2 ⋅ N + 1 2 ⋅ 1
127 126 oveq1d ⊢ N ∈ ℕ → 1 ⁢ 2 ⋅ N + 1 2 2 ⋅ N + 1 2 ⁢ 4 ⁢ N ⁢ N + 1 = 2 ⋅ N + 1 2 ⋅ 1 2 ⋅ N + 1 2 ⁢ 4 ⁢ N ⁢ N + 1
128 12 mulridd ⊢ N ∈ ℕ → 1 ⋅ 1 = 1
129 128 eqcomd ⊢ N ∈ ℕ → 1 = 1 ⋅ 1
130 129 oveq1d ⊢ N ∈ ℕ → 1 4 ⁢ N ⁢ N + 1 = 1 ⋅ 1 4 ⁢ N ⁢ N + 1
131 12 91 12 107 116 123 divmuldivd ⊢ N ∈ ℕ → 1 4 ⁢ 1 N ⁢ N + 1 = 1 ⋅ 1 4 ⁢ N ⁢ N + 1
132 130 131 eqtr4d ⊢ N ∈ ℕ → 1 4 ⁢ N ⁢ N + 1 = 1 4 ⁢ 1 N ⁢ N + 1
133 67 132 oveq12d ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 2 ⋅ N + 1 2 ⁢ 1 4 ⁢ N ⁢ N + 1 = 1 ⁢ 1 4 ⁢ 1 N ⁢ N + 1
134 14 14 12 108 33 124 divmuldivd ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 2 ⋅ N + 1 2 ⁢ 1 4 ⁢ N ⁢ N + 1 = 2 ⋅ N + 1 2 ⋅ 1 2 ⋅ N + 1 2 ⁢ 4 ⁢ N ⁢ N + 1
135 91 116 reccld ⊢ N ∈ ℕ → 1 4 ∈ ℂ
136 107 123 reccld ⊢ N ∈ ℕ → 1 N ⁢ N + 1 ∈ ℂ
137 135 136 mulcld ⊢ N ∈ ℕ → 1 4 ⁢ 1 N ⁢ N + 1 ∈ ℂ
138 137 mullidd ⊢ N ∈ ℕ → 1 ⁢ 1 4 ⁢ 1 N ⁢ N + 1 = 1 4 ⁢ 1 N ⁢ N + 1
139 133 134 138 3eqtr3d ⊢ N ∈ ℕ → 2 ⋅ N + 1 2 ⋅ 1 2 ⋅ N + 1 2 ⁢ 4 ⁢ N ⁢ N + 1 = 1 4 ⁢ 1 N ⁢ N + 1
140 125 127 139 3eqtrd ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 4 ⁢ N ⁢ N + 1 2 ⋅ N + 1 2 = 1 4 ⁢ 1 N ⁢ N + 1
141 113 140 eqtrd ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 2 1 1 − 1 2 ⋅ N + 1 2 = 1 4 ⁢ 1 N ⁢ N + 1
142 65 141 breqtrd ⊢ N ∈ ℕ → seq 1 + L ⇝ 1 4 ⁢ 1 N ⁢ N + 1
143 59 bilani ⊢ N ∈ ℕ ∧ j ∈ ℕ → j ∈ ℤ ≥ 1
144 oveq2 ⊢ k = n → 2 ⁢ k = 2 ⁢ n
145 144 oveq1d ⊢ k = n → 2 ⁢ k + 1 = 2 ⁢ n + 1
146 145 oveq2d ⊢ k = n → 1 2 ⁢ k + 1 = 1 2 ⁢ n + 1
147 144 oveq2d ⊢ k = n → 1 2 ⋅ N + 1 2 ⁢ k = 1 2 ⋅ N + 1 2 ⁢ n
148 146 147 oveq12d ⊢ k = n → 1 2 ⁢ k + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ k = 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ n
149 elfznn ⊢ n ∈ 1 … j → n ∈ ℕ
150 149 adantl ⊢ N ∈ ℕ ∧ n ∈ 1 … j → n ∈ ℕ
151 2cnd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ∈ ℂ
152 150 nncnd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → n ∈ ℂ
153 151 152 mulcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⁢ n ∈ ℂ
154 1cnd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 ∈ ℂ
155 153 154 addcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⁢ n + 1 ∈ ℂ
156 0red ⊢ n ∈ ℕ → 0 ∈ ℝ
157 1red ⊢ n ∈ ℕ → 1 ∈ ℝ
158 17 a1i ⊢ n ∈ ℕ → 2 ∈ ℝ
159 nnre ⊢ n ∈ ℕ → n ∈ ℝ
160 158 159 remulcld ⊢ n ∈ ℕ → 2 ⁢ n ∈ ℝ
161 160 157 readdcld ⊢ n ∈ ℕ → 2 ⁢ n + 1 ∈ ℝ
162 22 a1i ⊢ n ∈ ℕ → 0 < 1
163 24 a1i ⊢ n ∈ ℕ → 2 ∈ ℝ +
164 nnrp ⊢ n ∈ ℕ → n ∈ ℝ +
165 163 164 rpmulcld ⊢ n ∈ ℕ → 2 ⁢ n ∈ ℝ +
166 157 165 ltaddrp2d ⊢ n ∈ ℕ → 1 < 2 ⁢ n + 1
167 156 157 161 162 166 lttrd ⊢ n ∈ ℕ → 0 < 2 ⁢ n + 1
168 149 167 syl ⊢ n ∈ 1 … j → 0 < 2 ⁢ n + 1
169 168 gt0ne0d ⊢ n ∈ 1 … j → 2 ⁢ n + 1 ≠ 0
170 169 adantl ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⁢ n + 1 ≠ 0
171 155 170 reccld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ∈ ℂ
172 10 adantr ⊢ N ∈ ℕ ∧ n ∈ 1 … j → N ∈ ℂ
173 151 172 mulcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N ∈ ℂ
174 173 154 addcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N + 1 ∈ ℂ
175 30 adantr ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N + 1 ≠ 0
176 174 175 reccld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 ∈ ℂ
177 2nn0 ⊢ 2 ∈ ℕ 0
178 177 a1i ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ∈ ℕ 0
179 150 nnnn0d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → n ∈ ℕ 0
180 178 179 nn0mulcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⁢ n ∈ ℕ 0
181 176 180 expcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 ⁢ n ∈ ℂ
182 171 181 mulcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ n ∈ ℂ
183 3 148 150 182 fvmptd3 ⊢ N ∈ ℕ ∧ n ∈ 1 … j → K ⁡ n = 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ n
184 183 adantlr ⊢ N ∈ ℕ ∧ j ∈ ℕ ∧ n ∈ 1 … j → K ⁡ n = 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ n
185 167 gt0ne0d ⊢ n ∈ ℕ → 2 ⁢ n + 1 ≠ 0
186 161 185 rereccld ⊢ n ∈ ℕ → 1 2 ⁢ n + 1 ∈ ℝ
187 149 186 syl ⊢ n ∈ 1 … j → 1 2 ⁢ n + 1 ∈ ℝ
188 187 adantl ⊢ N ∈ ℕ ∧ j ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ∈ ℝ
189 21 30 rereccld ⊢ N ∈ ℕ → 1 2 ⋅ N + 1 ∈ ℝ
190 189 adantr ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 ∈ ℝ
191 190 180 reexpcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 ⁢ n ∈ ℝ
192 191 adantlr ⊢ N ∈ ℕ ∧ j ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 ⁢ n ∈ ℝ
193 188 192 remulcld ⊢ N ∈ ℕ ∧ j ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ n ∈ ℝ
194 184 193 eqeltrd ⊢ N ∈ ℕ ∧ j ∈ ℕ ∧ n ∈ 1 … j → K ⁡ n ∈ ℝ
195 readdcl ⊢ n ∈ ℝ ∧ i ∈ ℝ → n + i ∈ ℝ
196 195 adantl ⊢ N ∈ ℕ ∧ j ∈ ℕ ∧ n ∈ ℝ ∧ i ∈ ℝ → n + i ∈ ℝ
197 143 194 196 seqcl ⊢ N ∈ ℕ ∧ j ∈ ℕ → seq 1 + K ⁡ j ∈ ℝ
198 oveq2 ⊢ k = n → 1 2 ⋅ N + 1 2 k = 1 2 ⋅ N + 1 2 n
199 34 adantr ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 ∈ ℂ
200 199 179 expcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 n ∈ ℂ
201 4 198 150 200 fvmptd3 ⊢ N ∈ ℕ ∧ n ∈ 1 … j → L ⁡ n = 1 2 ⋅ N + 1 2 n
202 37 adantr ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 ∈ ℝ
203 202 179 reexpcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 n ∈ ℝ
204 201 203 eqeltrd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → L ⁡ n ∈ ℝ
205 204 adantlr ⊢ N ∈ ℕ ∧ j ∈ ℕ ∧ n ∈ 1 … j → L ⁡ n ∈ ℝ
206 143 205 196 seqcl ⊢ N ∈ ℕ ∧ j ∈ ℕ → seq 1 + L ⁡ j ∈ ℝ
207 31 a1i ⊢ n ∈ 1 … j → 2 ∈ ℤ
208 elfzelz ⊢ n ∈ 1 … j → n ∈ ℤ
209 207 208 zmulcld ⊢ n ∈ 1 … j → 2 ⁢ n ∈ ℤ
210 1exp ⊢ 2 ⁢ n ∈ ℤ → 1 2 ⁢ n = 1
211 209 210 syl ⊢ n ∈ 1 … j → 1 2 ⁢ n = 1
212 1exp ⊢ n ∈ ℤ → 1 n = 1
213 208 212 syl ⊢ n ∈ 1 … j → 1 n = 1
214 211 213 eqtr4d ⊢ n ∈ 1 … j → 1 2 ⁢ n = 1 n
215 214 adantl ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n = 1 n
216 174 179 178 expmuld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N + 1 2 ⁢ n = 2 ⋅ N + 1 2 n
217 215 216 oveq12d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n 2 ⋅ N + 1 2 ⁢ n = 1 n 2 ⋅ N + 1 2 n
218 154 174 175 180 expdivd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 ⁢ n = 1 2 ⁢ n 2 ⋅ N + 1 2 ⁢ n
219 174 sqcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N + 1 2 ∈ ℂ
220 31 a1i ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ∈ ℤ
221 174 175 220 expne0d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N + 1 2 ≠ 0
222 154 219 221 179 expdivd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 n = 1 n 2 ⋅ N + 1 2 n
223 217 218 222 3eqtr4d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 ⁢ n = 1 2 ⋅ N + 1 2 n
224 223 oveq2d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ n = 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 n
225 1rp ⊢ 1 ∈ ℝ +
226 225 a1i ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 ∈ ℝ +
227 17 a1i ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ∈ ℝ
228 150 nnred ⊢ N ∈ ℕ ∧ n ∈ 1 … j → n ∈ ℝ
229 227 228 remulcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⁢ n ∈ ℝ
230 178 nn0ge0d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 0 ≤ 2
231 179 nn0ge0d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 0 ≤ n
232 227 228 230 231 mulge0d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 0 ≤ 2 ⁢ n
233 229 232 ge0p1rpd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⁢ n + 1 ∈ ℝ +
234 1red ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 ∈ ℝ
235 226 rpge0d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 0 ≤ 1
236 157 161 166 ltled ⊢ n ∈ ℕ → 1 ≤ 2 ⁢ n + 1
237 149 236 syl ⊢ n ∈ 1 … j → 1 ≤ 2 ⁢ n + 1
238 237 adantl ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 ≤ 2 ⁢ n + 1
239 226 233 234 235 238 lediv2ad ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ≤ 1 1
240 154 div1d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 1 = 1
241 239 240 breqtrd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ≤ 1
242 150 186 syl ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ∈ ℝ
243 19 adantr ⊢ N ∈ ℕ ∧ n ∈ 1 … j → N ∈ ℝ
244 227 243 remulcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N ∈ ℝ
245 15 19 119 ltled ⊢ N ∈ ℕ → 0 ≤ N
246 245 adantr ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 0 ≤ N
247 227 243 230 246 mulge0d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 0 ≤ 2 ⋅ N
248 244 247 ge0p1rpd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N + 1 ∈ ℝ +
249 248 220 rpexpcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 2 ⋅ N + 1 2 ∈ ℝ +
250 249 rpreccld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 ∈ ℝ +
251 208 adantl ⊢ N ∈ ℕ ∧ n ∈ 1 … j → n ∈ ℤ
252 250 251 rpexpcld ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⋅ N + 1 2 n ∈ ℝ +
253 242 234 252 lemul1d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ≤ 1 ↔ 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 n ≤ 1 ⁢ 1 2 ⋅ N + 1 2 n
254 241 253 mpbid ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 n ≤ 1 ⁢ 1 2 ⋅ N + 1 2 n
255 200 mullidd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 ⁢ 1 2 ⋅ N + 1 2 n = 1 2 ⋅ N + 1 2 n
256 254 255 breqtrd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 n ≤ 1 2 ⋅ N + 1 2 n
257 224 256 eqbrtrd ⊢ N ∈ ℕ ∧ n ∈ 1 … j → 1 2 ⁢ n + 1 ⁢ 1 2 ⋅ N + 1 2 ⁢ n ≤ 1 2 ⋅ N + 1 2 n
258 257 183 201 3brtr4d ⊢ N ∈ ℕ ∧ n ∈ 1 … j → K ⁡ n ≤ L ⁡ n
259 258 adantlr ⊢ N ∈ ℕ ∧ j ∈ ℕ ∧ n ∈ 1 … j → K ⁡ n ≤ L ⁡ n
260 143 194 205 259 serle ⊢ N ∈ ℕ ∧ j ∈ ℕ → seq 1 + K ⁡ j ≤ seq 1 + L ⁡ j
261 5 6 8 142 197 206 260 climle ⊢ N ∈ ℕ → B ⁡ N − B ⁡ N + 1 ≤ 1 4 ⁢ 1 N ⁢ N + 1