lgamgulmlem3 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > lgamgulmlem3		Structured version Visualization version GIF version

Theorem lgamgulmlem3 27204

Description: Lemma for lgamgulm 27208. (Contributed by Mario Carneiro, 3-Jul-2017.)

**Hypotheses**
Ref	Expression
lgamgulm.r	⊢ (𝜑 → 𝑅 ∈ ℕ)
lgamgulm.u	⊢ 𝑈 = {𝑥 ∈ ℂ ∣ ((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)))}
lgamgulm.n	⊢ (𝜑 → 𝑁 ∈ ℕ)
lgamgulm.a	⊢ (𝜑 → 𝐴 ∈ 𝑈)
lgamgulm.l	⊢ (𝜑 → (2 · 𝑅) ≤ 𝑁)

**Assertion**
Ref	Expression
lgamgulmlem3	⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))

Distinct variable groups: 𝑥,𝑁 𝑥,𝑘,𝑅 𝐴,𝑘,𝑥 𝜑,𝑥 Allowed substitution hints: 𝜑(𝑘) 𝑈(𝑥, 𝑘) 𝑁(𝑘)

**Proof of Theorem lgamgulmlem3**
Step	Hyp	Ref	Expression
1		lgamgulm.r	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ ℕ)
2		lgamgulm.u	. . . . . . . 8 ⊢ 𝑈 = {𝑥 ∈ ℂ ∣ ((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)))}
3	1, 2	lgamgulmlem1 27202	. . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ (ℂ ∖ (ℤ ∖ ℕ)))
4		lgamgulm.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
5	3, 4	sseldd 3938	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (ℂ ∖ (ℤ ∖ ℕ)))
6	5	eldifad 3917	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ)
7		lgamgulm.n	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ)
8	7	peano2nnd 12254	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ)
9	8	nnrpd 13062	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℝ⁺)
10	7	nnrpd 13062	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ⁺)
11	9, 10	rpdivcld 13081	. . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) / 𝑁) ∈ ℝ⁺)
12	11	relogcld 26797	. . . . . 6 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ∈ ℝ)
13	12	recnd 11241	. . . . 5 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ∈ ℂ)
14	6, 13	mulcld 11233	. . . 4 ⊢ (𝜑 → (𝐴 · (log‘((𝑁 + 1) / 𝑁))) ∈ ℂ)
15	7	nncnd 12253	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ)
16	7	nnne0d 12290	. . . . . . 7 ⊢ (𝜑 → 𝑁 ≠ 0)
17	6, 15, 16	divcld 11995	. . . . . 6 ⊢ (𝜑 → (𝐴 / 𝑁) ∈ ℂ)
18		1cnd 11206	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ)
19	17, 18	addcld 11232	. . . . 5 ⊢ (𝜑 → ((𝐴 / 𝑁) + 1) ∈ ℂ)
20	5, 7	dmgmdivn0 27201	. . . . 5 ⊢ (𝜑 → ((𝐴 / 𝑁) + 1) ≠ 0)
21	19, 20	logcld 26744	. . . 4 ⊢ (𝜑 → (log‘((𝐴 / 𝑁) + 1)) ∈ ℂ)
22	14, 21	subcld 11573	. . 3 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1))) ∈ ℂ)
23	22	abscld 15495	. 2 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ∈ ℝ)
24	14, 17	subcld 11573	. . . 4 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) ∈ ℂ)
25	24	abscld 15495	. . 3 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) ∈ ℝ)
26	17, 21	subcld 11573	. . . 4 ⊢ (𝜑 → ((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))) ∈ ℂ)
27	26	abscld 15495	. . 3 ⊢ (𝜑 → (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1)))) ∈ ℝ)
28	25, 27	readdcld 11242	. 2 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ∈ ℝ)
29	1	nnred 12252	. . 3 ⊢ (𝜑 → 𝑅 ∈ ℝ)
30		2re 12319	. . . . . 6 ⊢ 2 ∈ ℝ
31	30	a1i 11	. . . . 5 ⊢ (𝜑 → 2 ∈ ℝ)
32		1red 11213	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ)
33	29, 32	readdcld 11242	. . . . 5 ⊢ (𝜑 → (𝑅 + 1) ∈ ℝ)
34	31, 33	remulcld 11243	. . . 4 ⊢ (𝜑 → (2 · (𝑅 + 1)) ∈ ℝ)
35	7	nnsqcld 14285	. . . 4 ⊢ (𝜑 → (𝑁↑2) ∈ ℕ)
36	34, 35	nndivred 12294	. . 3 ⊢ (𝜑 → ((2 · (𝑅 + 1)) / (𝑁↑2)) ∈ ℝ)
37	29, 36	remulcld 11243	. 2 ⊢ (𝜑 → (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))) ∈ ℝ)
38	14, 21, 17	abs3difd 15519	. 2 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ≤ ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))))
39	7	nnrecred 12291	. . . . . 6 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ)
40	8	nnrecred 12291	. . . . . 6 ⊢ (𝜑 → (1 / (𝑁 + 1)) ∈ ℝ)
41	39, 40	resubcld 11646	. . . . 5 ⊢ (𝜑 → ((1 / 𝑁) − (1 / (𝑁 + 1))) ∈ ℝ)
42	29, 41	remulcld 11243	. . . 4 ⊢ (𝜑 → (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) ∈ ℝ)
43	31, 29	remulcld 11243	. . . . . . . . 9 ⊢ (𝜑 → (2 · 𝑅) ∈ ℝ)
44	7	nnred 12252	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℝ)
45	1	nnrpd 13062	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
46	29, 45	ltaddrpd 13097	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 < (𝑅 + 𝑅))
47	1	nncnd 12253	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℂ)
48	47	2timesd 12491	. . . . . . . . . 10 ⊢ (𝜑 → (2 · 𝑅) = (𝑅 + 𝑅))
49	46, 48	breqtrrd 5139	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 < (2 · 𝑅))
50		lgamgulm.l	. . . . . . . . 9 ⊢ (𝜑 → (2 · 𝑅) ≤ 𝑁)
51	29, 43, 44, 49, 50	ltletrd 11374	. . . . . . . 8 ⊢ (𝜑 → 𝑅 < 𝑁)
52		difrp 13060	. . . . . . . . 9 ⊢ ((𝑅 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑅 < 𝑁 ↔ (𝑁 − 𝑅) ∈ ℝ⁺))
53	29, 44, 52	syl2anc 595	. . . . . . . 8 ⊢ (𝜑 → (𝑅 < 𝑁 ↔ (𝑁 − 𝑅) ∈ ℝ⁺))
54	51, 53	mpbid 235	. . . . . . 7 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℝ⁺)
55	54	rprecred 13075	. . . . . 6 ⊢ (𝜑 → (1 / (𝑁 − 𝑅)) ∈ ℝ)
56	55, 39	resubcld 11646	. . . . 5 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)) ∈ ℝ)
57	29, 56	remulcld 11243	. . . 4 ⊢ (𝜑 → (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))) ∈ ℝ)
58	42, 57	readdcld 11242	. . 3 ⊢ (𝜑 → ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) ∈ ℝ)
59	6, 15, 16	divrecd 11998	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 / 𝑁) = (𝐴 · (1 / 𝑁)))
60	59	oveq2d 7426	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) = ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 · (1 / 𝑁))))
61	39	recnd 11241	. . . . . . . . 9 ⊢ (𝜑 → (1 / 𝑁) ∈ ℂ)
62	6, 13, 61	subdid 11674	. . . . . . . 8 ⊢ (𝜑 → (𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) = ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 · (1 / 𝑁))))
63	60, 62	eqtr4d 2801	. . . . . . 7 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) = (𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))))
64	63	fveq2d 6885	. . . . . 6 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) = (abs‘(𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
65	13, 61	subcld 11573	. . . . . . 7 ⊢ (𝜑 → ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)) ∈ ℂ)
66	6, 65	absmuld 15513	. . . . . 6 ⊢ (𝜑 → (abs‘(𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))) = ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
67	64, 66	eqtrd 2798	. . . . 5 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) = ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
68	6	abscld 15495	. . . . . 6 ⊢ (𝜑 → (abs‘𝐴) ∈ ℝ)
69	65	abscld 15495	. . . . . 6 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) ∈ ℝ)
70	6	absge0d 15503	. . . . . 6 ⊢ (𝜑 → 0 ≤ (abs‘𝐴))
71	65	absge0d 15503	. . . . . 6 ⊢ (𝜑 → 0 ≤ (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))))
72		fveq2 6881	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (abs‘𝑥) = (abs‘𝐴))
73	72	breq1d 5119	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → ((abs‘𝑥) ≤ 𝑅 ↔ (abs‘𝐴) ≤ 𝑅))
74		fvoveq1 7433	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → (abs‘(𝑥 + 𝑘)) = (abs‘(𝐴 + 𝑘)))
75	74	breq2d 5121	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → ((1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
76	75	ralbidv 3188	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
77	73, 76	anbi12d 643	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘))) ↔ ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘)))))
78	77, 2	elrab2 3654	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑈 ↔ (𝐴 ∈ ℂ ∧ ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘)))))
79	78	simprbi 502	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑈 → ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
80	4, 79	syl 18	. . . . . . 7 ⊢ (𝜑 → ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
81	80	simpld 499	. . . . . 6 ⊢ (𝜑 → (abs‘𝐴) ≤ 𝑅)
82	9, 10	relogdivd 26800	. . . . . . . . 9 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) = ((log‘(𝑁 + 1)) − (log‘𝑁)))
83		logdifbnd 27167	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℝ⁺ → ((log‘(𝑁 + 1)) − (log‘𝑁)) ≤ (1 / 𝑁))
84	10, 83	syl 18	. . . . . . . . 9 ⊢ (𝜑 → ((log‘(𝑁 + 1)) − (log‘𝑁)) ≤ (1 / 𝑁))
85	82, 84	eqbrtrd 5133	. . . . . . . 8 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ≤ (1 / 𝑁))
86	12, 39, 85	abssuble0d 15491	. . . . . . 7 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) = ((1 / 𝑁) − (log‘((𝑁 + 1) / 𝑁))))
87		logdiflbnd 27168	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℝ⁺ → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
88	10, 87	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
89	88, 82	breqtrrd 5139	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 + 1)) ≤ (log‘((𝑁 + 1) / 𝑁)))
90	40, 12, 39, 89	lesub2dd 11835	. . . . . . 7 ⊢ (𝜑 → ((1 / 𝑁) − (log‘((𝑁 + 1) / 𝑁))) ≤ ((1 / 𝑁) − (1 / (𝑁 + 1))))
91	86, 90	eqbrtrd 5133	. . . . . 6 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) ≤ ((1 / 𝑁) − (1 / (𝑁 + 1))))
92	68, 29, 69, 41, 70, 71, 81, 91	lemul12ad 12161	. . . . 5 ⊢ (𝜑 → ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))) ≤ (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))))
93	67, 92	eqbrtrd 5133	. . . 4 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) ≤ (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))))
94	1, 2, 7, 4, 50	lgamgulmlem2 27203	. . . 4 ⊢ (𝜑 → (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1)))) ≤ (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))))
95	25, 27, 42, 57, 93, 94	le2addd 11837	. . 3 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ≤ ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
96	15, 47	subcld 11573	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℂ)
97	15, 18	addcld 11232	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℂ)
98	29, 51	gtned 11349	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≠ 𝑅)
99	15, 47, 98	subne0d 11582	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑅) ≠ 0)
100	8	nnne0d 12290	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ≠ 0)
101	96, 97, 99, 100	subrecd 12048	. . . . . . 7 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))) = (((𝑁 + 1) − (𝑁 − 𝑅)) / ((𝑁 − 𝑅) · (𝑁 + 1))))
102	15, 18, 47	pnncand 11612	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁 + 1) − (𝑁 − 𝑅)) = (1 + 𝑅))
103	18, 47, 102	comraddd 11428	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 + 1) − (𝑁 − 𝑅)) = (𝑅 + 1))
104	103	oveq1d 7425	. . . . . . 7 ⊢ (𝜑 → (((𝑁 + 1) − (𝑁 − 𝑅)) / ((𝑁 − 𝑅) · (𝑁 + 1))) = ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))))
105	101, 104	eqtr2d 2799	. . . . . 6 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) = ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))))
106	105	oveq2d 7426	. . . . 5 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) = (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1)))))
107	97, 100	reccld 11988	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 + 1)) ∈ ℂ)
108	96, 99	reccld 11988	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 − 𝑅)) ∈ ℂ)
109	61, 107, 108	npncan3d 11609	. . . . . . 7 ⊢ (𝜑 → (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))) = ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))))
110	109	eqcomd 2769	. . . . . 6 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))) = (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))))
111	110	oveq2d 7426	. . . . 5 ⊢ (𝜑 → (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1)))) = (𝑅 · (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
112	41	recnd 11241	. . . . . 6 ⊢ (𝜑 → ((1 / 𝑁) − (1 / (𝑁 + 1))) ∈ ℂ)
113	56	recnd 11241	. . . . . 6 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)) ∈ ℂ)
114	47, 112, 113	adddid 11237	. . . . 5 ⊢ (𝜑 → (𝑅 · (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) = ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
115	106, 111, 114	3eqtrd 2802	. . . 4 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) = ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
116	54, 9	rpmulcld 13080	. . . . . 6 ⊢ (𝜑 → ((𝑁 − 𝑅) · (𝑁 + 1)) ∈ ℝ⁺)
117	33, 116	rerpdivcld 13095	. . . . 5 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ∈ ℝ)
118	45	rpge0d 13068	. . . . 5 ⊢ (𝜑 → 0 ≤ 𝑅)
119		2z 12630	. . . . . . . . . 10 ⊢ 2 ∈ ℤ
120	119	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 2 ∈ ℤ)
121	10, 120	rpexpcld 14288	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ∈ ℝ⁺)
122	121	rphalfcld 13076	. . . . . . 7 ⊢ (𝜑 → ((𝑁↑2) / 2) ∈ ℝ⁺)
123		0le1 11741	. . . . . . . . 9 ⊢ 0 ≤ 1
124	123	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ 1)
125	29, 32, 118, 124	addge0d 11794	. . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑅 + 1))
126	15	sqvald 14184	. . . . . . . . . 10 ⊢ (𝜑 → (𝑁↑2) = (𝑁 · 𝑁))
127	126	oveq1d 7425	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁↑2) / 2) = ((𝑁 · 𝑁) / 2))
128	31	recnd 11241	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℂ)
129		2ne0 12351	. . . . . . . . . . 11 ⊢ 2 ≠ 0
130	129	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ≠ 0)
131	15, 15, 128, 130	div23d 12032	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁 · 𝑁) / 2) = ((𝑁 / 2) · 𝑁))
132	127, 131	eqtrd 2798	. . . . . . . 8 ⊢ (𝜑 → ((𝑁↑2) / 2) = ((𝑁 / 2) · 𝑁))
133	44	rehalfcld 12495	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 / 2) ∈ ℝ)
134	44, 29	resubcld 11646	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℝ)
135	44, 32	readdcld 11242	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 + 1) ∈ ℝ)
136		2rp 13025	. . . . . . . . . . 11 ⊢ 2 ∈ ℝ⁺
137	136	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℝ⁺)
138	10	rpge0d 13068	. . . . . . . . . 10 ⊢ (𝜑 → 0 ≤ 𝑁)
139	44, 137, 138	divge0d 13104	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ (𝑁 / 2))
140	29, 44, 137	lemuldiv2d 13114	. . . . . . . . . . . 12 ⊢ (𝜑 → ((2 · 𝑅) ≤ 𝑁 ↔ 𝑅 ≤ (𝑁 / 2)))
141	50, 140	mpbid 235	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ≤ (𝑁 / 2))
142	15	2halvesd 12494	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁 / 2) + (𝑁 / 2)) = 𝑁)
143	133	recnd 11241	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑁 / 2) ∈ ℂ)
144	15, 143, 143	subaddd 11591	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁 − (𝑁 / 2)) = (𝑁 / 2) ↔ ((𝑁 / 2) + (𝑁 / 2)) = 𝑁))
145	142, 144	mpbird 260	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁 − (𝑁 / 2)) = (𝑁 / 2))
146	141, 145	breqtrrd 5139	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ≤ (𝑁 − (𝑁 / 2)))
147	29, 44, 133, 146	lesubd 11822	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 / 2) ≤ (𝑁 − 𝑅))
148	44	lep1d 12150	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≤ (𝑁 + 1))
149	133, 134, 44, 135, 139, 138, 147, 148	lemul12ad 12161	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 / 2) · 𝑁) ≤ ((𝑁 − 𝑅) · (𝑁 + 1)))
150	132, 149	eqbrtrd 5133	. . . . . . 7 ⊢ (𝜑 → ((𝑁↑2) / 2) ≤ ((𝑁 − 𝑅) · (𝑁 + 1)))
151	122, 116, 33, 125, 150	lediv2ad 13086	. . . . . 6 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ≤ ((𝑅 + 1) / ((𝑁↑2) / 2)))
152	1	peano2nnd 12254	. . . . . . . . 9 ⊢ (𝜑 → (𝑅 + 1) ∈ ℕ)
153	152	nncnd 12253	. . . . . . . 8 ⊢ (𝜑 → (𝑅 + 1) ∈ ℂ)
154	35	nncnd 12253	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ∈ ℂ)
155	35	nnne0d 12290	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ≠ 0)
156	153, 154, 128, 155, 130	divdiv2d 12027	. . . . . . 7 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁↑2) / 2)) = (((𝑅 + 1) · 2) / (𝑁↑2)))
157	153, 128	mulcomd 11234	. . . . . . . 8 ⊢ (𝜑 → ((𝑅 + 1) · 2) = (2 · (𝑅 + 1)))
158	157	oveq1d 7425	. . . . . . 7 ⊢ (𝜑 → (((𝑅 + 1) · 2) / (𝑁↑2)) = ((2 · (𝑅 + 1)) / (𝑁↑2)))
159	156, 158	eqtr2d 2799	. . . . . 6 ⊢ (𝜑 → ((2 · (𝑅 + 1)) / (𝑁↑2)) = ((𝑅 + 1) / ((𝑁↑2) / 2)))
160	151, 159	breqtrrd 5139	. . . . 5 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ≤ ((2 · (𝑅 + 1)) / (𝑁↑2)))
161	117, 36, 29, 118, 160	lemul2ad 12159	. . . 4 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
162	115, 161	eqbrtrrd 5135	. . 3 ⊢ (𝜑 → ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
163	28, 58, 37, 95, 162	letrd 11371	. 2 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
164	23, 28, 37, 38, 163	letrd 11371	1 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 {crab 3416 ∖ cdif 3902 class class class wbr 5109 ‘cfv 6536 (class class class)co 7410 ℂcc 11102 ℝcr 11103 0cc0 11104 1c1 11105 + caddc 11107 · cmul 11109 < clt 11247 ≤ cle 11248 − cmin 11445 / cdiv 11875 ℕcn 12237 2c2 12299 ℕ₀cn0 12508 ℤcz 12595 ℝ⁺crp 13020 ↑cexp 14102 abscabs 15290 logclog 26728

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9606 ax-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181 ax-pre-sup 11182 ax-addf 11183

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7674 df-om 7859 df-1st 7982 df-2nd 7983 df-supp 8153 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-map 8822 df-pm 8823 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9318 df-fi 9367 df-sup 9398 df-inf 9399 df-oi 9468 df-card 9930 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-div 11876 df-nn 12238 df-2 12307 df-3 12308 df-4 12309 df-5 12310 df-6 12311 df-7 12312 df-8 12313 df-9 12314 df-n0 12509 df-z 12596 df-dec 12716 df-uz 12867 df-q 12977 df-rp 13021 df-xneg 13141 df-xadd 13142 df-xmul 13143 df-ioo 13380 df-ioc 13381 df-ico 13382 df-icc 13383 df-fz 13540 df-fzo 13688 df-fl 13830 df-mod 13908 df-seq 14043 df-exp 14103 df-fac 14315 df-bc 14344 df-hash 14372 df-shft 15109 df-cj 15155 df-re 15156 df-im 15157 df-sqrt 15291 df-abs 15292 df-limsup 15527 df-clim 15544 df-rlim 15545 df-sum 15743 df-ef 16125 df-sin 16127 df-cos 16128 df-tan 16129 df-pi 16130 df-struct 17211 df-sets 17228 df-slot 17246 df-ndx 17258 df-base 17274 df-ress 17295 df-plusg 17327 df-mulr 17328 df-starv 17329 df-sca 17330 df-vsca 17331 df-ip 17332 df-tset 17333 df-ple 17334 df-ds 17336 df-unif 17337 df-hom 17338 df-cco 17339 df-rest 17479 df-topn 17480 df-0g 17498 df-gsum 17499 df-topgen 17500 df-pt 17501 df-prds 17504 df-xrs 17560 df-qtop 17565 df-imas 17566 df-xps 17568 df-mre 17642 df-mrc 17643 df-acs 17645 df-mgm 18702 df-sgrp 18781 df-mnd 18797 df-submnd 18846 df-mulg 19138 df-cntz 19391 df-cmn 19856 df-psmet 21523 df-xmet 21524 df-met 21525 df-bl 21526 df-mopn 21527 df-fbas 21528 df-fg 21529 df-cnfld 21532 df-top 23060 df-topon 23077 df-topsp 23099 df-bases 23112 df-cld 23185 df-ntr 23186 df-cls 23187 df-nei 23264 df-lp 23302 df-perf 23303 df-cn 23393 df-cnp 23394 df-haus 23481 df-cmp 23553 df-tx 23728 df-hmeo 23921 df-fil 24012 df-fm 24104 df-flim 24105 df-flf 24106 df-xms 24486 df-ms 24487 df-tms 24488 df-cncf 25046 df-limc 26034 df-dv 26035 df-log 26730

This theorem is used by: lgamgulmlem5 27206

W3C validator