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 27391

Description: Lemma for lgamgulm 27395. (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 27389	. . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ (ℂ ∖ (ℤ ∖ ℕ)))
4		lgamgulm.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
5	3, 4	sseldd 3914	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (ℂ ∖ (ℤ ∖ ℕ)))
6	5	eldifad 4054	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ)
7		lgamgulm.n	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ)
8	7	peano2nnd 12382	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ)
9	8	nnrpd 13192	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℝ⁺)
10	7	nnrpd 13192	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ⁺)
11	9, 10	rpdivcld 13211	. . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) / 𝑁) ∈ ℝ⁺)
12	11	relogcld 26984	. . . . . 6 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ∈ ℝ)
13	12	recnd 11367	. . . . 5 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ∈ ℂ)
14	6, 13	mulcld 11359	. . . 4 ⊢ (𝜑 → (𝐴 · (log‘((𝑁 + 1) / 𝑁))) ∈ ℂ)
15	7	nncnd 12381	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ)
16	7	nnne0d 12418	. . . . . . 7 ⊢ (𝜑 → 𝑁 ≠ 0)
17	6, 15, 16	divcld 12123	. . . . . 6 ⊢ (𝜑 → (𝐴 / 𝑁) ∈ ℂ)
18		1cnd 11332	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ)
19	17, 18	addcld 11358	. . . . 5 ⊢ (𝜑 → ((𝐴 / 𝑁) + 1) ∈ ℂ)
20	5, 7	dmgmdivn0 27388	. . . . 5 ⊢ (𝜑 → ((𝐴 / 𝑁) + 1) ≠ 0)
21	19, 20	logcld 26931	. . . 4 ⊢ (𝜑 → (log‘((𝐴 / 𝑁) + 1)) ∈ ℂ)
22	14, 21	subcld 11699	. . 3 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1))) ∈ ℂ)
23	22	abscld 15638	. 2 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ∈ ℝ)
24	14, 17	subcld 11699	. . . 4 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) ∈ ℂ)
25	24	abscld 15638	. . 3 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) ∈ ℝ)
26	17, 21	subcld 11699	. . . 4 ⊢ (𝜑 → ((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))) ∈ ℂ)
27	26	abscld 15638	. . 3 ⊢ (𝜑 → (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1)))) ∈ ℝ)
28	25, 27	readdcld 11368	. 2 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ∈ ℝ)
29	1	nnred 12380	. . 3 ⊢ (𝜑 → 𝑅 ∈ ℝ)
30		2re 12447	. . . . . 6 ⊢ 2 ∈ ℝ
31	30	a1i 11	. . . . 5 ⊢ (𝜑 → 2 ∈ ℝ)
32		1red 11339	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ)
33	29, 32	readdcld 11368	. . . . 5 ⊢ (𝜑 → (𝑅 + 1) ∈ ℝ)
34	31, 33	remulcld 11369	. . . 4 ⊢ (𝜑 → (2 · (𝑅 + 1)) ∈ ℝ)
35	7	nnsqcld 14418	. . . 4 ⊢ (𝜑 → (𝑁↑2) ∈ ℕ)
36	34, 35	nndivred 12422	. . 3 ⊢ (𝜑 → ((2 · (𝑅 + 1)) / (𝑁↑2)) ∈ ℝ)
37	29, 36	remulcld 11369	. 2 ⊢ (𝜑 → (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))) ∈ ℝ)
38	14, 21, 17	abs3difd 15662	. 2 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ≤ ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))))
39	7	nnrecred 12419	. . . . . 6 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ)
40	8	nnrecred 12419	. . . . . 6 ⊢ (𝜑 → (1 / (𝑁 + 1)) ∈ ℝ)
41	39, 40	resubcld 11774	. . . . 5 ⊢ (𝜑 → ((1 / 𝑁) − (1 / (𝑁 + 1))) ∈ ℝ)
42	29, 41	remulcld 11369	. . . 4 ⊢ (𝜑 → (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) ∈ ℝ)
43	31, 29	remulcld 11369	. . . . . . . . 9 ⊢ (𝜑 → (2 · 𝑅) ∈ ℝ)
44	7	nnred 12380	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℝ)
45	1	nnrpd 13192	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
46	29, 45	ltaddrpd 13227	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 < (𝑅 + 𝑅))
47	1	nncnd 12381	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℂ)
48	47	2timesd 12619	. . . . . . . . . 10 ⊢ (𝜑 → (2 · 𝑅) = (𝑅 + 𝑅))
49	46, 48	breqtrrd 5137	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 < (2 · 𝑅))
50		lgamgulm.l	. . . . . . . . 9 ⊢ (𝜑 → (2 · 𝑅) ≤ 𝑁)
51	29, 43, 44, 49, 50	ltletrd 11500	. . . . . . . 8 ⊢ (𝜑 → 𝑅 < 𝑁)
52		difrp 13190	. . . . . . . . 9 ⊢ ((𝑅 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑅 < 𝑁 ↔ (𝑁 − 𝑅) ∈ ℝ⁺))
53	29, 44, 52	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (𝑅 < 𝑁 ↔ (𝑁 − 𝑅) ∈ ℝ⁺))
54	51, 53	mpbid 235	. . . . . . 7 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℝ⁺)
55	54	rprecred 13205	. . . . . 6 ⊢ (𝜑 → (1 / (𝑁 − 𝑅)) ∈ ℝ)
56	55, 39	resubcld 11774	. . . . 5 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)) ∈ ℝ)
57	29, 56	remulcld 11369	. . . 4 ⊢ (𝜑 → (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))) ∈ ℝ)
58	42, 57	readdcld 11368	. . 3 ⊢ (𝜑 → ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) ∈ ℝ)
59	6, 15, 16	divrecd 12126	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 / 𝑁) = (𝐴 · (1 / 𝑁)))
60	59	oveq2d 7462	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) = ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 · (1 / 𝑁))))
61	39	recnd 11367	. . . . . . . . 9 ⊢ (𝜑 → (1 / 𝑁) ∈ ℂ)
62	6, 13, 61	subdid 11802	. . . . . . . 8 ⊢ (𝜑 → (𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) = ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 · (1 / 𝑁))))
63	60, 62	eqtr4d 2801	. . . . . . 7 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) = (𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))))
64	63	fveq2d 6915	. . . . . 6 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) = (abs‘(𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
65	13, 61	subcld 11699	. . . . . . 7 ⊢ (𝜑 → ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)) ∈ ℂ)
66	6, 65	absmuld 15656	. . . . . 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 15638	. . . . . 6 ⊢ (𝜑 → (abs‘𝐴) ∈ ℝ)
69	65	abscld 15638	. . . . . 6 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) ∈ ℝ)
70	6	absge0d 15646	. . . . . 6 ⊢ (𝜑 → 0 ≤ (abs‘𝐴))
71	65	absge0d 15646	. . . . . 6 ⊢ (𝜑 → 0 ≤ (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))))
72		fveq2 6911	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (abs‘𝑥) = (abs‘𝐴))
73	72	breq1d 5116	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → ((abs‘𝑥) ≤ 𝑅 ↔ (abs‘𝐴) ≤ 𝑅))
74		fvoveq1 7469	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → (abs‘(𝑥 + 𝑘)) = (abs‘(𝐴 + 𝑘)))
75	74	breq2d 5118	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → ((1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
76	75	ralbidv 3189	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
77	73, 76	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘))) ↔ ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘)))))
78	77, 2	elrab2 3652	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑈 ↔ (𝐴 ∈ ℂ ∧ ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘)))))
79	78	simprbi 503	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑈 → ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
80	4, 79	syl 18	. . . . . . 7 ⊢ (𝜑 → ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
81	80	simpld 500	. . . . . 6 ⊢ (𝜑 → (abs‘𝐴) ≤ 𝑅)
82	9, 10	relogdivd 26987	. . . . . . . . 9 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) = ((log‘(𝑁 + 1)) − (log‘𝑁)))
83		logdifbnd 27354	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℝ⁺ → ((log‘(𝑁 + 1)) − (log‘𝑁)) ≤ (1 / 𝑁))
84	10, 83	syl 18	. . . . . . . . 9 ⊢ (𝜑 → ((log‘(𝑁 + 1)) − (log‘𝑁)) ≤ (1 / 𝑁))
85	82, 84	eqbrtrd 5131	. . . . . . . 8 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ≤ (1 / 𝑁))
86	12, 39, 85	abssuble0d 15634	. . . . . . 7 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) = ((1 / 𝑁) − (log‘((𝑁 + 1) / 𝑁))))
87		logdiflbnd 27355	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℝ⁺ → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
88	10, 87	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
89	88, 82	breqtrrd 5137	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 + 1)) ≤ (log‘((𝑁 + 1) / 𝑁)))
90	40, 12, 39, 89	lesub2dd 11963	. . . . . . 7 ⊢ (𝜑 → ((1 / 𝑁) − (log‘((𝑁 + 1) / 𝑁))) ≤ ((1 / 𝑁) − (1 / (𝑁 + 1))))
91	86, 90	eqbrtrd 5131	. . . . . 6 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) ≤ ((1 / 𝑁) − (1 / (𝑁 + 1))))
92	68, 29, 69, 41, 70, 71, 81, 91	lemul12ad 12289	. . . . 5 ⊢ (𝜑 → ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))) ≤ (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))))
93	67, 92	eqbrtrd 5131	. . . 4 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) ≤ (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))))
94	1, 2, 7, 4, 50	lgamgulmlem2 27390	. . . 4 ⊢ (𝜑 → (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1)))) ≤ (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))))
95	25, 27, 42, 57, 93, 94	le2addd 11965	. . 3 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ≤ ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
96	15, 47	subcld 11699	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℂ)
97	15, 18	addcld 11358	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℂ)
98	29, 51	gtned 11475	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≠ 𝑅)
99	15, 47, 98	subne0d 11709	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑅) ≠ 0)
100	8	nnne0d 12418	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ≠ 0)
101	96, 97, 99, 100	subrecd 12176	. . . . . . 7 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))) = (((𝑁 + 1) − (𝑁 − 𝑅)) / ((𝑁 − 𝑅) · (𝑁 + 1))))
102	15, 18, 47	pnncand 11738	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁 + 1) − (𝑁 − 𝑅)) = (1 + 𝑅))
103	18, 47, 102	comraddd 11554	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 + 1) − (𝑁 − 𝑅)) = (𝑅 + 1))
104	103	oveq1d 7461	. . . . . . 7 ⊢ (𝜑 → (((𝑁 + 1) − (𝑁 − 𝑅)) / ((𝑁 − 𝑅) · (𝑁 + 1))) = ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))))
105	101, 104	eqtr2d 2799	. . . . . 6 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) = ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))))
106	105	oveq2d 7462	. . . . 5 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) = (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1)))))
107	97, 100	reccld 12116	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 + 1)) ∈ ℂ)
108	96, 99	reccld 12116	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 − 𝑅)) ∈ ℂ)
109	61, 107, 108	npncan3d 11735	. . . . . . 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 7462	. . . . 5 ⊢ (𝜑 → (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1)))) = (𝑅 · (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
112	41	recnd 11367	. . . . . 6 ⊢ (𝜑 → ((1 / 𝑁) − (1 / (𝑁 + 1))) ∈ ℂ)
113	56	recnd 11367	. . . . . 6 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)) ∈ ℂ)
114	47, 112, 113	adddid 11363	. . . . 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 13210	. . . . . 6 ⊢ (𝜑 → ((𝑁 − 𝑅) · (𝑁 + 1)) ∈ ℝ⁺)
117	33, 116	rerpdivcld 13225	. . . . 5 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ∈ ℝ)
118	45	rpge0d 13198	. . . . 5 ⊢ (𝜑 → 0 ≤ 𝑅)
119		2z 12758	. . . . . . . . . 10 ⊢ 2 ∈ ℤ
120	119	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 2 ∈ ℤ)
121	10, 120	rpexpcld 14421	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ∈ ℝ⁺)
122	121	rphalfcld 13206	. . . . . . 7 ⊢ (𝜑 → ((𝑁↑2) / 2) ∈ ℝ⁺)
123		0le1 11869	. . . . . . . . 9 ⊢ 0 ≤ 1
124	123	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ 1)
125	29, 32, 118, 124	addge0d 11922	. . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑅 + 1))
126	15	sqvald 14316	. . . . . . . . . 10 ⊢ (𝜑 → (𝑁↑2) = (𝑁 · 𝑁))
127	126	oveq1d 7461	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁↑2) / 2) = ((𝑁 · 𝑁) / 2))
128	31	recnd 11367	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℂ)
129		2ne0 12479	. . . . . . . . . . 11 ⊢ 2 ≠ 0
130	129	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ≠ 0)
131	15, 15, 128, 130	div23d 12160	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁 · 𝑁) / 2) = ((𝑁 / 2) · 𝑁))
132	127, 131	eqtrd 2798	. . . . . . . 8 ⊢ (𝜑 → ((𝑁↑2) / 2) = ((𝑁 / 2) · 𝑁))
133	44	rehalfcld 12623	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 / 2) ∈ ℝ)
134	44, 29	resubcld 11774	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℝ)
135	44, 32	readdcld 11368	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 + 1) ∈ ℝ)
136		2rp 13155	. . . . . . . . . . 11 ⊢ 2 ∈ ℝ⁺
137	136	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℝ⁺)
138	10	rpge0d 13198	. . . . . . . . . 10 ⊢ (𝜑 → 0 ≤ 𝑁)
139	44, 137, 138	divge0d 13234	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ (𝑁 / 2))
140	29, 44, 137	lemuldiv2d 13244	. . . . . . . . . . . 12 ⊢ (𝜑 → ((2 · 𝑅) ≤ 𝑁 ↔ 𝑅 ≤ (𝑁 / 2)))
141	50, 140	mpbid 235	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ≤ (𝑁 / 2))
142	15	2halvesd 12622	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁 / 2) + (𝑁 / 2)) = 𝑁)
143	133	recnd 11367	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑁 / 2) ∈ ℂ)
144	15, 143, 143	subaddd 11717	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁 − (𝑁 / 2)) = (𝑁 / 2) ↔ ((𝑁 / 2) + (𝑁 / 2)) = 𝑁))
145	142, 144	mpbird 260	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁 − (𝑁 / 2)) = (𝑁 / 2))
146	141, 145	breqtrrd 5137	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ≤ (𝑁 − (𝑁 / 2)))
147	29, 44, 133, 146	lesubd 11950	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 / 2) ≤ (𝑁 − 𝑅))
148	44	lep1d 12278	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≤ (𝑁 + 1))
149	133, 134, 44, 135, 139, 138, 147, 148	lemul12ad 12289	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 / 2) · 𝑁) ≤ ((𝑁 − 𝑅) · (𝑁 + 1)))
150	132, 149	eqbrtrd 5131	. . . . . . 7 ⊢ (𝜑 → ((𝑁↑2) / 2) ≤ ((𝑁 − 𝑅) · (𝑁 + 1)))
151	122, 116, 33, 125, 150	lediv2ad 13216	. . . . . 6 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ≤ ((𝑅 + 1) / ((𝑁↑2) / 2)))
152	1	peano2nnd 12382	. . . . . . . . 9 ⊢ (𝜑 → (𝑅 + 1) ∈ ℕ)
153	152	nncnd 12381	. . . . . . . 8 ⊢ (𝜑 → (𝑅 + 1) ∈ ℂ)
154	35	nncnd 12381	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ∈ ℂ)
155	35	nnne0d 12418	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ≠ 0)
156	153, 154, 128, 155, 130	divdiv2d 12155	. . . . . . 7 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁↑2) / 2)) = (((𝑅 + 1) · 2) / (𝑁↑2)))
157	153, 128	mulcomd 11360	. . . . . . . 8 ⊢ (𝜑 → ((𝑅 + 1) · 2) = (2 · (𝑅 + 1)))
158	157	oveq1d 7461	. . . . . . 7 ⊢ (𝜑 → (((𝑅 + 1) · 2) / (𝑁↑2)) = ((2 · (𝑅 + 1)) / (𝑁↑2)))
159	156, 158	eqtr2d 2799	. . . . . 6 ⊢ (𝜑 → ((2 · (𝑅 + 1)) / (𝑁↑2)) = ((𝑅 + 1) / ((𝑁↑2) / 2)))
160	151, 159	breqtrrd 5137	. . . . 5 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ≤ ((2 · (𝑅 + 1)) / (𝑁↑2)))
161	117, 36, 29, 118, 160	lemul2ad 12287	. . . 4 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
162	115, 161	eqbrtrrd 5133	. . 3 ⊢ (𝜑 → ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
163	28, 58, 37, 95, 162	letrd 11497	. 2 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
164	23, 28, 37, 38, 163	letrd 11497	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 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 {crab 3416 ∖ cdif 4048 class class class wbr 5106 ‘cfv 6561 (class class class)co 7446 ℂcc 11228 ℝcr 11229 0cc0 11230 1c1 11231 + caddc 11233 · cmul 11235 < clt 11373 ≤ cle 11374 − cmin 11571 / cdiv 12003 ℕcn 12365 2c2 12427 ℕ₀cn0 12636 ℤcz 12723 ℝ⁺crp 13150 ↑cexp 14234 abscabs 15433 logclog 26915

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-inf2 9672 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 ax-pre-sup 11308 ax-addf 11309

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-of 7720 df-om 7905 df-1st 8028 df-2nd 8029 df-supp 8208 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-2o 8508 df-er 8748 df-map 8880 df-pm 8881 df-ixp 8957 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-fsupp 9385 df-fi 9433 df-sup 9464 df-inf 9465 df-oi 9534 df-card 10050 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 df-nn 12366 df-2 12435 df-3 12436 df-4 12437 df-5 12438 df-6 12439 df-7 12440 df-8 12441 df-9 12442 df-n0 12637 df-z 12724 df-dec 12845 df-uz 12996 df-q 13106 df-rp 13151 df-xneg 13271 df-xadd 13272 df-xmul 13273 df-ioo 13510 df-ioc 13511 df-ico 13512 df-icc 13513 df-fz 13670 df-fzo 13819 df-fl 13962 df-mod 14040 df-seq 14175 df-exp 14235 df-fac 14448 df-bc 14477 df-hash 14505 df-shft 15252 df-cj 15298 df-re 15299 df-im 15300 df-sqrt 15434 df-abs 15435 df-limsup 15670 df-clim 15687 df-rlim 15688 df-sum 15886 df-ef 16265 df-sin 16267 df-cos 16268 df-tan 16269 df-pi 16270 df-struct 17357 df-sets 17374 df-slot 17392 df-ndx 17404 df-base 17420 df-ress 17441 df-plusg 17473 df-mulr 17474 df-starv 17475 df-sca 17476 df-vsca 17477 df-ip 17478 df-tset 17479 df-ple 17480 df-ds 17482 df-unif 17483 df-hom 17484 df-cco 17485 df-rest 17625 df-topn 17626 df-0g 17644 df-gsum 17645 df-topgen 17646 df-pt 17647 df-prds 17650 df-xrs 17706 df-qtop 17711 df-imas 17712 df-xps 17714 df-mre 17788 df-mrc 17789 df-acs 17791 df-mgm 18848 df-sgrp 18940 df-mnd 18956 df-submnd 19011 df-mulg 19310 df-cntz 19564 df-cmn 20029 df-psmet 21703 df-xmet 21704 df-met 21705 df-bl 21706 df-mopn 21707 df-fbas 21708 df-fg 21709 df-cnfld 21712 df-top 23245 df-topon 23262 df-topsp 23284 df-bases 23297 df-cld 23370 df-ntr 23371 df-cls 23372 df-nei 23449 df-lp 23487 df-perf 23488 df-cn 23578 df-cnp 23579 df-haus 23666 df-cmp 23738 df-tx 23914 df-hmeo 24107 df-fil 24198 df-fm 24290 df-flim 24291 df-flf 24292 df-xms 24672 df-ms 24673 df-tms 24674 df-cncf 25232 df-limc 26219 df-dv 26220 df-log 26917

This theorem is used by: lgamgulmlem5 27393

W3C validator