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 24557

Description: Lemma for lgamgulm 24561. (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 24555	. . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ (ℂ ∖ (ℤ ∖ ℕ)))
4		lgamgulm.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
5	3, 4	sseldd 3569	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (ℂ ∖ (ℤ ∖ ℕ)))
6	5	eldifad 3552	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ)
7		lgamgulm.n	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ)
8	7	peano2nnd 10914	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ)
9	8	nnrpd 11746	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℝ⁺)
10	7	nnrpd 11746	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ⁺)
11	9, 10	rpdivcld 11765	. . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) / 𝑁) ∈ ℝ⁺)
12	11	relogcld 24173	. . . . . 6 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ∈ ℝ)
13	12	recnd 9947	. . . . 5 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ∈ ℂ)
14	6, 13	mulcld 9939	. . . 4 ⊢ (𝜑 → (𝐴 · (log‘((𝑁 + 1) / 𝑁))) ∈ ℂ)
15	7	nncnd 10913	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ)
16	7	nnne0d 10942	. . . . . . 7 ⊢ (𝜑 → 𝑁 ≠ 0)
17	6, 15, 16	divcld 10680	. . . . . 6 ⊢ (𝜑 → (𝐴 / 𝑁) ∈ ℂ)
18		1cnd 9935	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ)
19	17, 18	addcld 9938	. . . . 5 ⊢ (𝜑 → ((𝐴 / 𝑁) + 1) ∈ ℂ)
20	5, 7	dmgmdivn0 24554	. . . . 5 ⊢ (𝜑 → ((𝐴 / 𝑁) + 1) ≠ 0)
21	19, 20	logcld 24121	. . . 4 ⊢ (𝜑 → (log‘((𝐴 / 𝑁) + 1)) ∈ ℂ)
22	14, 21	subcld 10271	. . 3 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1))) ∈ ℂ)
23	22	abscld 14023	. 2 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ∈ ℝ)
24	14, 17	subcld 10271	. . . 4 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) ∈ ℂ)
25	24	abscld 14023	. . 3 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) ∈ ℝ)
26	17, 21	subcld 10271	. . . 4 ⊢ (𝜑 → ((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))) ∈ ℂ)
27	26	abscld 14023	. . 3 ⊢ (𝜑 → (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1)))) ∈ ℝ)
28	25, 27	readdcld 9948	. 2 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ∈ ℝ)
29	1	nnred 10912	. . 3 ⊢ (𝜑 → 𝑅 ∈ ℝ)
30		2re 10967	. . . . . 6 ⊢ 2 ∈ ℝ
31	30	a1i 11	. . . . 5 ⊢ (𝜑 → 2 ∈ ℝ)
32		1red 9934	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ)
33	29, 32	readdcld 9948	. . . . 5 ⊢ (𝜑 → (𝑅 + 1) ∈ ℝ)
34	31, 33	remulcld 9949	. . . 4 ⊢ (𝜑 → (2 · (𝑅 + 1)) ∈ ℝ)
35	7	nnsqcld 12891	. . . 4 ⊢ (𝜑 → (𝑁↑2) ∈ ℕ)
36	34, 35	nndivred 10946	. . 3 ⊢ (𝜑 → ((2 · (𝑅 + 1)) / (𝑁↑2)) ∈ ℝ)
37	29, 36	remulcld 9949	. 2 ⊢ (𝜑 → (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))) ∈ ℝ)
38	14, 21, 17	abs3difd 14047	. 2 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ≤ ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))))
39	7	nnrecred 10943	. . . . . 6 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ)
40	8	nnrecred 10943	. . . . . 6 ⊢ (𝜑 → (1 / (𝑁 + 1)) ∈ ℝ)
41	39, 40	resubcld 10337	. . . . 5 ⊢ (𝜑 → ((1 / 𝑁) − (1 / (𝑁 + 1))) ∈ ℝ)
42	29, 41	remulcld 9949	. . . 4 ⊢ (𝜑 → (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) ∈ ℝ)
43	31, 29	remulcld 9949	. . . . . . . . 9 ⊢ (𝜑 → (2 · 𝑅) ∈ ℝ)
44	7	nnred 10912	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℝ)
45	1	nnrpd 11746	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
46	29, 45	ltaddrpd 11781	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 < (𝑅 + 𝑅))
47	1	nncnd 10913	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℂ)
48	47	2timesd 11152	. . . . . . . . . 10 ⊢ (𝜑 → (2 · 𝑅) = (𝑅 + 𝑅))
49	46, 48	breqtrrd 4611	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 < (2 · 𝑅))
50		lgamgulm.l	. . . . . . . . 9 ⊢ (𝜑 → (2 · 𝑅) ≤ 𝑁)
51	29, 43, 44, 49, 50	ltletrd 10076	. . . . . . . 8 ⊢ (𝜑 → 𝑅 < 𝑁)
52		difrp 11744	. . . . . . . . 9 ⊢ ((𝑅 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑅 < 𝑁 ↔ (𝑁 − 𝑅) ∈ ℝ⁺))
53	29, 44, 52	syl2anc 691	. . . . . . . 8 ⊢ (𝜑 → (𝑅 < 𝑁 ↔ (𝑁 − 𝑅) ∈ ℝ⁺))
54	51, 53	mpbid 221	. . . . . . 7 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℝ⁺)
55	54	rprecred 11759	. . . . . 6 ⊢ (𝜑 → (1 / (𝑁 − 𝑅)) ∈ ℝ)
56	55, 39	resubcld 10337	. . . . 5 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)) ∈ ℝ)
57	29, 56	remulcld 9949	. . . 4 ⊢ (𝜑 → (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))) ∈ ℝ)
58	42, 57	readdcld 9948	. . 3 ⊢ (𝜑 → ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) ∈ ℝ)
59	6, 15, 16	divrecd 10683	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 / 𝑁) = (𝐴 · (1 / 𝑁)))
60	59	oveq2d 6565	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) = ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 · (1 / 𝑁))))
61	39	recnd 9947	. . . . . . . . 9 ⊢ (𝜑 → (1 / 𝑁) ∈ ℂ)
62	6, 13, 61	subdid 10365	. . . . . . . 8 ⊢ (𝜑 → (𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) = ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 · (1 / 𝑁))))
63	60, 62	eqtr4d 2647	. . . . . . 7 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) = (𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))))
64	63	fveq2d 6107	. . . . . 6 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) = (abs‘(𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
65	13, 61	subcld 10271	. . . . . . 7 ⊢ (𝜑 → ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)) ∈ ℂ)
66	6, 65	absmuld 14041	. . . . . 6 ⊢ (𝜑 → (abs‘(𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))) = ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
67	64, 66	eqtrd 2644	. . . . 5 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) = ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
68	6	abscld 14023	. . . . . 6 ⊢ (𝜑 → (abs‘𝐴) ∈ ℝ)
69	65	abscld 14023	. . . . . 6 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) ∈ ℝ)
70	6	absge0d 14031	. . . . . 6 ⊢ (𝜑 → 0 ≤ (abs‘𝐴))
71	65	absge0d 14031	. . . . . 6 ⊢ (𝜑 → 0 ≤ (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))))
72		fveq2 6103	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (abs‘𝑥) = (abs‘𝐴))
73	72	breq1d 4593	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → ((abs‘𝑥) ≤ 𝑅 ↔ (abs‘𝐴) ≤ 𝑅))
74		oveq1 6556	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → (𝑥 + 𝑘) = (𝐴 + 𝑘))
75	74	fveq2d 6107	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → (abs‘(𝑥 + 𝑘)) = (abs‘(𝐴 + 𝑘)))
76	75	breq2d 4595	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → ((1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
77	76	ralbidv 2969	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
78	73, 77	anbi12d 743	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘))) ↔ ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘)))))
79	78, 2	elrab2 3333	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑈 ↔ (𝐴 ∈ ℂ ∧ ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘)))))
80	79	simprbi 479	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑈 → ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
81	4, 80	syl 17	. . . . . . 7 ⊢ (𝜑 → ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
82	81	simpld 474	. . . . . 6 ⊢ (𝜑 → (abs‘𝐴) ≤ 𝑅)
83	9, 10	relogdivd 24176	. . . . . . . . 9 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) = ((log‘(𝑁 + 1)) − (log‘𝑁)))
84		logdifbnd 24520	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℝ⁺ → ((log‘(𝑁 + 1)) − (log‘𝑁)) ≤ (1 / 𝑁))
85	10, 84	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((log‘(𝑁 + 1)) − (log‘𝑁)) ≤ (1 / 𝑁))
86	83, 85	eqbrtrd 4605	. . . . . . . 8 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ≤ (1 / 𝑁))
87	12, 39, 86	abssuble0d 14019	. . . . . . 7 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) = ((1 / 𝑁) − (log‘((𝑁 + 1) / 𝑁))))
88		logdiflbnd 24521	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℝ⁺ → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
89	10, 88	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
90	89, 83	breqtrrd 4611	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 + 1)) ≤ (log‘((𝑁 + 1) / 𝑁)))
91	40, 12, 39, 90	lesub2dd 10523	. . . . . . 7 ⊢ (𝜑 → ((1 / 𝑁) − (log‘((𝑁 + 1) / 𝑁))) ≤ ((1 / 𝑁) − (1 / (𝑁 + 1))))
92	87, 91	eqbrtrd 4605	. . . . . 6 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) ≤ ((1 / 𝑁) − (1 / (𝑁 + 1))))
93	68, 29, 69, 41, 70, 71, 82, 92	lemul12ad 10845	. . . . 5 ⊢ (𝜑 → ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))) ≤ (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))))
94	67, 93	eqbrtrd 4605	. . . 4 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) ≤ (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))))
95	1, 2, 7, 4, 50	lgamgulmlem2 24556	. . . 4 ⊢ (𝜑 → (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1)))) ≤ (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))))
96	25, 27, 42, 57, 94, 95	le2addd 10525	. . 3 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ≤ ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
97	15, 47	subcld 10271	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℂ)
98	15, 18	addcld 9938	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℂ)
99	29, 51	gtned 10051	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≠ 𝑅)
100	15, 47, 99	subne0d 10280	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑅) ≠ 0)
101	8	nnne0d 10942	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ≠ 0)
102	97, 98, 100, 101	subrecd 10735	. . . . . . 7 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))) = (((𝑁 + 1) − (𝑁 − 𝑅)) / ((𝑁 − 𝑅) · (𝑁 + 1))))
103	15, 18, 47	pnncand 10310	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁 + 1) − (𝑁 − 𝑅)) = (1 + 𝑅))
104	18, 47	addcomd 10117	. . . . . . . . 9 ⊢ (𝜑 → (1 + 𝑅) = (𝑅 + 1))
105	103, 104	eqtrd 2644	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 + 1) − (𝑁 − 𝑅)) = (𝑅 + 1))
106	105	oveq1d 6564	. . . . . . 7 ⊢ (𝜑 → (((𝑁 + 1) − (𝑁 − 𝑅)) / ((𝑁 − 𝑅) · (𝑁 + 1))) = ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))))
107	102, 106	eqtr2d 2645	. . . . . 6 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) = ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))))
108	107	oveq2d 6565	. . . . 5 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) = (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1)))))
109	98, 101	reccld 10673	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 + 1)) ∈ ℂ)
110	97, 100	reccld 10673	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 − 𝑅)) ∈ ℂ)
111	61, 109, 110	npncan3d 10307	. . . . . . 7 ⊢ (𝜑 → (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))) = ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))))
112	111	eqcomd 2616	. . . . . 6 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))) = (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))))
113	112	oveq2d 6565	. . . . 5 ⊢ (𝜑 → (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1)))) = (𝑅 · (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
114	41	recnd 9947	. . . . . 6 ⊢ (𝜑 → ((1 / 𝑁) − (1 / (𝑁 + 1))) ∈ ℂ)
115	56	recnd 9947	. . . . . 6 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)) ∈ ℂ)
116	47, 114, 115	adddid 9943	. . . . 5 ⊢ (𝜑 → (𝑅 · (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) = ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
117	108, 113, 116	3eqtrd 2648	. . . 4 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) = ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
118	54, 9	rpmulcld 11764	. . . . . 6 ⊢ (𝜑 → ((𝑁 − 𝑅) · (𝑁 + 1)) ∈ ℝ⁺)
119	33, 118	rerpdivcld 11779	. . . . 5 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ∈ ℝ)
120	45	rpge0d 11752	. . . . 5 ⊢ (𝜑 → 0 ≤ 𝑅)
121		2z 11286	. . . . . . . . . 10 ⊢ 2 ∈ ℤ
122	121	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 2 ∈ ℤ)
123	10, 122	rpexpcld 12894	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ∈ ℝ⁺)
124	123	rphalfcld 11760	. . . . . . 7 ⊢ (𝜑 → ((𝑁↑2) / 2) ∈ ℝ⁺)
125		0le1 10430	. . . . . . . . 9 ⊢ 0 ≤ 1
126	125	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ 1)
127	29, 32, 120, 126	addge0d 10482	. . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑅 + 1))
128	15	sqvald 12867	. . . . . . . . . 10 ⊢ (𝜑 → (𝑁↑2) = (𝑁 · 𝑁))
129	128	oveq1d 6564	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁↑2) / 2) = ((𝑁 · 𝑁) / 2))
130	31	recnd 9947	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℂ)
131		2ne0 10990	. . . . . . . . . . 11 ⊢ 2 ≠ 0
132	131	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ≠ 0)
133	15, 15, 130, 132	div23d 10717	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁 · 𝑁) / 2) = ((𝑁 / 2) · 𝑁))
134	129, 133	eqtrd 2644	. . . . . . . 8 ⊢ (𝜑 → ((𝑁↑2) / 2) = ((𝑁 / 2) · 𝑁))
135	44	rehalfcld 11156	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 / 2) ∈ ℝ)
136	44, 29	resubcld 10337	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℝ)
137	44, 32	readdcld 9948	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 + 1) ∈ ℝ)
138		2rp 11713	. . . . . . . . . . 11 ⊢ 2 ∈ ℝ⁺
139	138	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℝ⁺)
140	10	rpge0d 11752	. . . . . . . . . 10 ⊢ (𝜑 → 0 ≤ 𝑁)
141	44, 139, 140	divge0d 11788	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ (𝑁 / 2))
142	29, 44, 139	lemuldiv2d 11798	. . . . . . . . . . . 12 ⊢ (𝜑 → ((2 · 𝑅) ≤ 𝑁 ↔ 𝑅 ≤ (𝑁 / 2)))
143	50, 142	mpbid 221	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ≤ (𝑁 / 2))
144	15	2halvesd 11155	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁 / 2) + (𝑁 / 2)) = 𝑁)
145	135	recnd 9947	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑁 / 2) ∈ ℂ)
146	15, 145, 145	subaddd 10289	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁 − (𝑁 / 2)) = (𝑁 / 2) ↔ ((𝑁 / 2) + (𝑁 / 2)) = 𝑁))
147	144, 146	mpbird 246	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁 − (𝑁 / 2)) = (𝑁 / 2))
148	143, 147	breqtrrd 4611	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ≤ (𝑁 − (𝑁 / 2)))
149	29, 44, 135, 148	lesubd 10510	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 / 2) ≤ (𝑁 − 𝑅))
150	44	lep1d 10834	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≤ (𝑁 + 1))
151	135, 136, 44, 137, 141, 140, 149, 150	lemul12ad 10845	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 / 2) · 𝑁) ≤ ((𝑁 − 𝑅) · (𝑁 + 1)))
152	134, 151	eqbrtrd 4605	. . . . . . 7 ⊢ (𝜑 → ((𝑁↑2) / 2) ≤ ((𝑁 − 𝑅) · (𝑁 + 1)))
153	124, 118, 33, 127, 152	lediv2ad 11770	. . . . . 6 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ≤ ((𝑅 + 1) / ((𝑁↑2) / 2)))
154	1	peano2nnd 10914	. . . . . . . . 9 ⊢ (𝜑 → (𝑅 + 1) ∈ ℕ)
155	154	nncnd 10913	. . . . . . . 8 ⊢ (𝜑 → (𝑅 + 1) ∈ ℂ)
156	35	nncnd 10913	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ∈ ℂ)
157	35	nnne0d 10942	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ≠ 0)
158	155, 156, 130, 157, 132	divdiv2d 10712	. . . . . . 7 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁↑2) / 2)) = (((𝑅 + 1) · 2) / (𝑁↑2)))
159	155, 130	mulcomd 9940	. . . . . . . 8 ⊢ (𝜑 → ((𝑅 + 1) · 2) = (2 · (𝑅 + 1)))
160	159	oveq1d 6564	. . . . . . 7 ⊢ (𝜑 → (((𝑅 + 1) · 2) / (𝑁↑2)) = ((2 · (𝑅 + 1)) / (𝑁↑2)))
161	158, 160	eqtr2d 2645	. . . . . 6 ⊢ (𝜑 → ((2 · (𝑅 + 1)) / (𝑁↑2)) = ((𝑅 + 1) / ((𝑁↑2) / 2)))
162	153, 161	breqtrrd 4611	. . . . 5 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ≤ ((2 · (𝑅 + 1)) / (𝑁↑2)))
163	119, 36, 29, 120, 162	lemul2ad 10843	. . . 4 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
164	117, 163	eqbrtrrd 4607	. . 3 ⊢ (𝜑 → ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
165	28, 58, 37, 96, 164	letrd 10073	. 2 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
166	23, 28, 37, 38, 165	letrd 10073	1 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∀wral 2896 {crab 2900 ∖ cdif 3537 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 · cmul 9820 < clt 9953 ≤ cle 9954 − cmin 10145 / cdiv 10563 ℕcn 10897 2c2 10947 ℕ₀cn0 11169 ℤcz 11254 ℝ⁺crp 11708 ↑cexp 12722 abscabs 13822 logclog 24105

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 ax-addf 9894 ax-mulf 9895

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-iin 4458 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-of 6795 df-om 6958 df-1st 7059 df-2nd 7060 df-supp 7183 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-er 7629 df-map 7746 df-pm 7747 df-ixp 7795 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-fsupp 8159 df-fi 8200 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-cda 8873 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-uz 11564 df-q 11665 df-rp 11709 df-xneg 11822 df-xadd 11823 df-xmul 11824 df-ioo 12050 df-ioc 12051 df-ico 12052 df-icc 12053 df-fz 12198 df-fzo 12335 df-fl 12455 df-mod 12531 df-seq 12664 df-exp 12723 df-fac 12923 df-bc 12952 df-hash 12980 df-shft 13655 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-limsup 14050 df-clim 14067 df-rlim 14068 df-sum 14265 df-ef 14637 df-sin 14639 df-cos 14640 df-tan 14641 df-pi 14642 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-mulr 15782 df-starv 15783 df-sca 15784 df-vsca 15785 df-ip 15786 df-tset 15787 df-ple 15788 df-ds 15791 df-unif 15792 df-hom 15793 df-cco 15794 df-rest 15906 df-topn 15907 df-0g 15925 df-gsum 15926 df-topgen 15927 df-pt 15928 df-prds 15931 df-xrs 15985 df-qtop 15990 df-imas 15991 df-xps 15993 df-mre 16069 df-mrc 16070 df-acs 16072 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-submnd 17159 df-mulg 17364 df-cntz 17573 df-cmn 18018 df-psmet 19559 df-xmet 19560 df-met 19561 df-bl 19562 df-mopn 19563 df-fbas 19564 df-fg 19565 df-cnfld 19568 df-top 20521 df-bases 20522 df-topon 20523 df-topsp 20524 df-cld 20633 df-ntr 20634 df-cls 20635 df-nei 20712 df-lp 20750 df-perf 20751 df-cn 20841 df-cnp 20842 df-haus 20929 df-cmp 21000 df-tx 21175 df-hmeo 21368 df-fil 21460 df-fm 21552 df-flim 21553 df-flf 21554 df-xms 21935 df-ms 21936 df-tms 21937 df-cncf 22489 df-limc 23436 df-dv 23437 df-log 24107

This theorem is referenced by: lgamgulmlem5 24559

W3C validator