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 26085

Description: Lemma for lgamgulm 26089. (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 26083	. . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ (ℂ ∖ (ℤ ∖ ℕ)))
4		lgamgulm.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
5	3, 4	sseldd 3918	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (ℂ ∖ (ℤ ∖ ℕ)))
6	5	eldifad 3895	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ)
7		lgamgulm.n	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ)
8	7	peano2nnd 11920	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ)
9	8	nnrpd 12699	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℝ⁺)
10	7	nnrpd 12699	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ⁺)
11	9, 10	rpdivcld 12718	. . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) / 𝑁) ∈ ℝ⁺)
12	11	relogcld 25683	. . . . . 6 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ∈ ℝ)
13	12	recnd 10934	. . . . 5 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ∈ ℂ)
14	6, 13	mulcld 10926	. . . 4 ⊢ (𝜑 → (𝐴 · (log‘((𝑁 + 1) / 𝑁))) ∈ ℂ)
15	7	nncnd 11919	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ)
16	7	nnne0d 11953	. . . . . . 7 ⊢ (𝜑 → 𝑁 ≠ 0)
17	6, 15, 16	divcld 11681	. . . . . 6 ⊢ (𝜑 → (𝐴 / 𝑁) ∈ ℂ)
18		1cnd 10901	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ)
19	17, 18	addcld 10925	. . . . 5 ⊢ (𝜑 → ((𝐴 / 𝑁) + 1) ∈ ℂ)
20	5, 7	dmgmdivn0 26082	. . . . 5 ⊢ (𝜑 → ((𝐴 / 𝑁) + 1) ≠ 0)
21	19, 20	logcld 25631	. . . 4 ⊢ (𝜑 → (log‘((𝐴 / 𝑁) + 1)) ∈ ℂ)
22	14, 21	subcld 11262	. . 3 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1))) ∈ ℂ)
23	22	abscld 15076	. 2 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ∈ ℝ)
24	14, 17	subcld 11262	. . . 4 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) ∈ ℂ)
25	24	abscld 15076	. . 3 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) ∈ ℝ)
26	17, 21	subcld 11262	. . . 4 ⊢ (𝜑 → ((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))) ∈ ℂ)
27	26	abscld 15076	. . 3 ⊢ (𝜑 → (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1)))) ∈ ℝ)
28	25, 27	readdcld 10935	. 2 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ∈ ℝ)
29	1	nnred 11918	. . 3 ⊢ (𝜑 → 𝑅 ∈ ℝ)
30		2re 11977	. . . . . 6 ⊢ 2 ∈ ℝ
31	30	a1i 11	. . . . 5 ⊢ (𝜑 → 2 ∈ ℝ)
32		1red 10907	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ)
33	29, 32	readdcld 10935	. . . . 5 ⊢ (𝜑 → (𝑅 + 1) ∈ ℝ)
34	31, 33	remulcld 10936	. . . 4 ⊢ (𝜑 → (2 · (𝑅 + 1)) ∈ ℝ)
35	7	nnsqcld 13887	. . . 4 ⊢ (𝜑 → (𝑁↑2) ∈ ℕ)
36	34, 35	nndivred 11957	. . 3 ⊢ (𝜑 → ((2 · (𝑅 + 1)) / (𝑁↑2)) ∈ ℝ)
37	29, 36	remulcld 10936	. 2 ⊢ (𝜑 → (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))) ∈ ℝ)
38	14, 21, 17	abs3difd 15100	. 2 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ≤ ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))))
39	7	nnrecred 11954	. . . . . 6 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ)
40	8	nnrecred 11954	. . . . . 6 ⊢ (𝜑 → (1 / (𝑁 + 1)) ∈ ℝ)
41	39, 40	resubcld 11333	. . . . 5 ⊢ (𝜑 → ((1 / 𝑁) − (1 / (𝑁 + 1))) ∈ ℝ)
42	29, 41	remulcld 10936	. . . 4 ⊢ (𝜑 → (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) ∈ ℝ)
43	31, 29	remulcld 10936	. . . . . . . . 9 ⊢ (𝜑 → (2 · 𝑅) ∈ ℝ)
44	7	nnred 11918	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℝ)
45	1	nnrpd 12699	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
46	29, 45	ltaddrpd 12734	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 < (𝑅 + 𝑅))
47	1	nncnd 11919	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℂ)
48	47	2timesd 12146	. . . . . . . . . 10 ⊢ (𝜑 → (2 · 𝑅) = (𝑅 + 𝑅))
49	46, 48	breqtrrd 5098	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 < (2 · 𝑅))
50		lgamgulm.l	. . . . . . . . 9 ⊢ (𝜑 → (2 · 𝑅) ≤ 𝑁)
51	29, 43, 44, 49, 50	ltletrd 11065	. . . . . . . 8 ⊢ (𝜑 → 𝑅 < 𝑁)
52		difrp 12697	. . . . . . . . 9 ⊢ ((𝑅 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑅 < 𝑁 ↔ (𝑁 − 𝑅) ∈ ℝ⁺))
53	29, 44, 52	syl2anc 583	. . . . . . . 8 ⊢ (𝜑 → (𝑅 < 𝑁 ↔ (𝑁 − 𝑅) ∈ ℝ⁺))
54	51, 53	mpbid 231	. . . . . . 7 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℝ⁺)
55	54	rprecred 12712	. . . . . 6 ⊢ (𝜑 → (1 / (𝑁 − 𝑅)) ∈ ℝ)
56	55, 39	resubcld 11333	. . . . 5 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)) ∈ ℝ)
57	29, 56	remulcld 10936	. . . 4 ⊢ (𝜑 → (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))) ∈ ℝ)
58	42, 57	readdcld 10935	. . 3 ⊢ (𝜑 → ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) ∈ ℝ)
59	6, 15, 16	divrecd 11684	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 / 𝑁) = (𝐴 · (1 / 𝑁)))
60	59	oveq2d 7271	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) = ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 · (1 / 𝑁))))
61	39	recnd 10934	. . . . . . . . 9 ⊢ (𝜑 → (1 / 𝑁) ∈ ℂ)
62	6, 13, 61	subdid 11361	. . . . . . . 8 ⊢ (𝜑 → (𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) = ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 · (1 / 𝑁))))
63	60, 62	eqtr4d 2781	. . . . . . 7 ⊢ (𝜑 → ((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁)) = (𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))))
64	63	fveq2d 6760	. . . . . 6 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) = (abs‘(𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
65	13, 61	subcld 11262	. . . . . . 7 ⊢ (𝜑 → ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)) ∈ ℂ)
66	6, 65	absmuld 15094	. . . . . 6 ⊢ (𝜑 → (abs‘(𝐴 · ((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))) = ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
67	64, 66	eqtrd 2778	. . . . 5 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) = ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))))
68	6	abscld 15076	. . . . . 6 ⊢ (𝜑 → (abs‘𝐴) ∈ ℝ)
69	65	abscld 15076	. . . . . 6 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) ∈ ℝ)
70	6	absge0d 15084	. . . . . 6 ⊢ (𝜑 → 0 ≤ (abs‘𝐴))
71	65	absge0d 15084	. . . . . 6 ⊢ (𝜑 → 0 ≤ (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))))
72		fveq2 6756	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (abs‘𝑥) = (abs‘𝐴))
73	72	breq1d 5080	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → ((abs‘𝑥) ≤ 𝑅 ↔ (abs‘𝐴) ≤ 𝑅))
74		fvoveq1 7278	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → (abs‘(𝑥 + 𝑘)) = (abs‘(𝐴 + 𝑘)))
75	74	breq2d 5082	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → ((1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
76	75	ralbidv 3120	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
77	73, 76	anbi12d 630	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘))) ↔ ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘)))))
78	77, 2	elrab2 3620	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑈 ↔ (𝐴 ∈ ℂ ∧ ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘)))))
79	78	simprbi 496	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑈 → ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
80	4, 79	syl 17	. . . . . . 7 ⊢ (𝜑 → ((abs‘𝐴) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝐴 + 𝑘))))
81	80	simpld 494	. . . . . 6 ⊢ (𝜑 → (abs‘𝐴) ≤ 𝑅)
82	9, 10	relogdivd 25686	. . . . . . . . 9 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) = ((log‘(𝑁 + 1)) − (log‘𝑁)))
83		logdifbnd 26048	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℝ⁺ → ((log‘(𝑁 + 1)) − (log‘𝑁)) ≤ (1 / 𝑁))
84	10, 83	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((log‘(𝑁 + 1)) − (log‘𝑁)) ≤ (1 / 𝑁))
85	82, 84	eqbrtrd 5092	. . . . . . . 8 ⊢ (𝜑 → (log‘((𝑁 + 1) / 𝑁)) ≤ (1 / 𝑁))
86	12, 39, 85	abssuble0d 15072	. . . . . . 7 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) = ((1 / 𝑁) − (log‘((𝑁 + 1) / 𝑁))))
87		logdiflbnd 26049	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℝ⁺ → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
88	10, 87	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
89	88, 82	breqtrrd 5098	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 + 1)) ≤ (log‘((𝑁 + 1) / 𝑁)))
90	40, 12, 39, 89	lesub2dd 11522	. . . . . . 7 ⊢ (𝜑 → ((1 / 𝑁) − (log‘((𝑁 + 1) / 𝑁))) ≤ ((1 / 𝑁) − (1 / (𝑁 + 1))))
91	86, 90	eqbrtrd 5092	. . . . . 6 ⊢ (𝜑 → (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁))) ≤ ((1 / 𝑁) − (1 / (𝑁 + 1))))
92	68, 29, 69, 41, 70, 71, 81, 91	lemul12ad 11847	. . . . 5 ⊢ (𝜑 → ((abs‘𝐴) · (abs‘((log‘((𝑁 + 1) / 𝑁)) − (1 / 𝑁)))) ≤ (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))))
93	67, 92	eqbrtrd 5092	. . . 4 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) ≤ (𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))))
94	1, 2, 7, 4, 50	lgamgulmlem2 26084	. . . 4 ⊢ (𝜑 → (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1)))) ≤ (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))))
95	25, 27, 42, 57, 93, 94	le2addd 11524	. . 3 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ≤ ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
96	15, 47	subcld 11262	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℂ)
97	15, 18	addcld 10925	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℂ)
98	29, 51	gtned 11040	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≠ 𝑅)
99	15, 47, 98	subne0d 11271	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑅) ≠ 0)
100	8	nnne0d 11953	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ≠ 0)
101	96, 97, 99, 100	subrecd 11736	. . . . . . 7 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))) = (((𝑁 + 1) − (𝑁 − 𝑅)) / ((𝑁 − 𝑅) · (𝑁 + 1))))
102	15, 18, 47	pnncand 11301	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁 + 1) − (𝑁 − 𝑅)) = (1 + 𝑅))
103	18, 47, 102	comraddd 11119	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 + 1) − (𝑁 − 𝑅)) = (𝑅 + 1))
104	103	oveq1d 7270	. . . . . . 7 ⊢ (𝜑 → (((𝑁 + 1) − (𝑁 − 𝑅)) / ((𝑁 − 𝑅) · (𝑁 + 1))) = ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))))
105	101, 104	eqtr2d 2779	. . . . . 6 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) = ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))))
106	105	oveq2d 7271	. . . . 5 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) = (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1)))))
107	97, 100	reccld 11674	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 + 1)) ∈ ℂ)
108	96, 99	reccld 11674	. . . . . . . 8 ⊢ (𝜑 → (1 / (𝑁 − 𝑅)) ∈ ℂ)
109	61, 107, 108	npncan3d 11298	. . . . . . 7 ⊢ (𝜑 → (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))) = ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))))
110	109	eqcomd 2744	. . . . . 6 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1))) = (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁))))
111	110	oveq2d 7271	. . . . 5 ⊢ (𝜑 → (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / (𝑁 + 1)))) = (𝑅 · (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
112	41	recnd 10934	. . . . . 6 ⊢ (𝜑 → ((1 / 𝑁) − (1 / (𝑁 + 1))) ∈ ℂ)
113	56	recnd 10934	. . . . . 6 ⊢ (𝜑 → ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)) ∈ ℂ)
114	47, 112, 113	adddid 10930	. . . . 5 ⊢ (𝜑 → (𝑅 · (((1 / 𝑁) − (1 / (𝑁 + 1))) + ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) = ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
115	106, 111, 114	3eqtrd 2782	. . . 4 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) = ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))))
116	54, 9	rpmulcld 12717	. . . . . 6 ⊢ (𝜑 → ((𝑁 − 𝑅) · (𝑁 + 1)) ∈ ℝ⁺)
117	33, 116	rerpdivcld 12732	. . . . 5 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ∈ ℝ)
118	45	rpge0d 12705	. . . . 5 ⊢ (𝜑 → 0 ≤ 𝑅)
119		2z 12282	. . . . . . . . . 10 ⊢ 2 ∈ ℤ
120	119	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 2 ∈ ℤ)
121	10, 120	rpexpcld 13890	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ∈ ℝ⁺)
122	121	rphalfcld 12713	. . . . . . 7 ⊢ (𝜑 → ((𝑁↑2) / 2) ∈ ℝ⁺)
123		0le1 11428	. . . . . . . . 9 ⊢ 0 ≤ 1
124	123	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ 1)
125	29, 32, 118, 124	addge0d 11481	. . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑅 + 1))
126	15	sqvald 13789	. . . . . . . . . 10 ⊢ (𝜑 → (𝑁↑2) = (𝑁 · 𝑁))
127	126	oveq1d 7270	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁↑2) / 2) = ((𝑁 · 𝑁) / 2))
128	31	recnd 10934	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℂ)
129		2ne0 12007	. . . . . . . . . . 11 ⊢ 2 ≠ 0
130	129	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ≠ 0)
131	15, 15, 128, 130	div23d 11718	. . . . . . . . 9 ⊢ (𝜑 → ((𝑁 · 𝑁) / 2) = ((𝑁 / 2) · 𝑁))
132	127, 131	eqtrd 2778	. . . . . . . 8 ⊢ (𝜑 → ((𝑁↑2) / 2) = ((𝑁 / 2) · 𝑁))
133	44	rehalfcld 12150	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 / 2) ∈ ℝ)
134	44, 29	resubcld 11333	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 − 𝑅) ∈ ℝ)
135	44, 32	readdcld 10935	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 + 1) ∈ ℝ)
136		2rp 12664	. . . . . . . . . . 11 ⊢ 2 ∈ ℝ⁺
137	136	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℝ⁺)
138	10	rpge0d 12705	. . . . . . . . . 10 ⊢ (𝜑 → 0 ≤ 𝑁)
139	44, 137, 138	divge0d 12741	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ (𝑁 / 2))
140	29, 44, 137	lemuldiv2d 12751	. . . . . . . . . . . 12 ⊢ (𝜑 → ((2 · 𝑅) ≤ 𝑁 ↔ 𝑅 ≤ (𝑁 / 2)))
141	50, 140	mpbid 231	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ≤ (𝑁 / 2))
142	15	2halvesd 12149	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁 / 2) + (𝑁 / 2)) = 𝑁)
143	133	recnd 10934	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑁 / 2) ∈ ℂ)
144	15, 143, 143	subaddd 11280	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑁 − (𝑁 / 2)) = (𝑁 / 2) ↔ ((𝑁 / 2) + (𝑁 / 2)) = 𝑁))
145	142, 144	mpbird 256	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁 − (𝑁 / 2)) = (𝑁 / 2))
146	141, 145	breqtrrd 5098	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ≤ (𝑁 − (𝑁 / 2)))
147	29, 44, 133, 146	lesubd 11509	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 / 2) ≤ (𝑁 − 𝑅))
148	44	lep1d 11836	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ≤ (𝑁 + 1))
149	133, 134, 44, 135, 139, 138, 147, 148	lemul12ad 11847	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 / 2) · 𝑁) ≤ ((𝑁 − 𝑅) · (𝑁 + 1)))
150	132, 149	eqbrtrd 5092	. . . . . . 7 ⊢ (𝜑 → ((𝑁↑2) / 2) ≤ ((𝑁 − 𝑅) · (𝑁 + 1)))
151	122, 116, 33, 125, 150	lediv2ad 12723	. . . . . 6 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ≤ ((𝑅 + 1) / ((𝑁↑2) / 2)))
152	1	peano2nnd 11920	. . . . . . . . 9 ⊢ (𝜑 → (𝑅 + 1) ∈ ℕ)
153	152	nncnd 11919	. . . . . . . 8 ⊢ (𝜑 → (𝑅 + 1) ∈ ℂ)
154	35	nncnd 11919	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ∈ ℂ)
155	35	nnne0d 11953	. . . . . . . 8 ⊢ (𝜑 → (𝑁↑2) ≠ 0)
156	153, 154, 128, 155, 130	divdiv2d 11713	. . . . . . 7 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁↑2) / 2)) = (((𝑅 + 1) · 2) / (𝑁↑2)))
157	153, 128	mulcomd 10927	. . . . . . . 8 ⊢ (𝜑 → ((𝑅 + 1) · 2) = (2 · (𝑅 + 1)))
158	157	oveq1d 7270	. . . . . . 7 ⊢ (𝜑 → (((𝑅 + 1) · 2) / (𝑁↑2)) = ((2 · (𝑅 + 1)) / (𝑁↑2)))
159	156, 158	eqtr2d 2779	. . . . . 6 ⊢ (𝜑 → ((2 · (𝑅 + 1)) / (𝑁↑2)) = ((𝑅 + 1) / ((𝑁↑2) / 2)))
160	151, 159	breqtrrd 5098	. . . . 5 ⊢ (𝜑 → ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1))) ≤ ((2 · (𝑅 + 1)) / (𝑁↑2)))
161	117, 36, 29, 118, 160	lemul2ad 11845	. . . 4 ⊢ (𝜑 → (𝑅 · ((𝑅 + 1) / ((𝑁 − 𝑅) · (𝑁 + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
162	115, 161	eqbrtrrd 5094	. . 3 ⊢ (𝜑 → ((𝑅 · ((1 / 𝑁) − (1 / (𝑁 + 1)))) + (𝑅 · ((1 / (𝑁 − 𝑅)) − (1 / 𝑁)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
163	28, 58, 37, 95, 162	letrd 11062	. 2 ⊢ (𝜑 → ((abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (𝐴 / 𝑁))) + (abs‘((𝐴 / 𝑁) − (log‘((𝐴 / 𝑁) + 1))))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))
164	23, 28, 37, 38, 163	letrd 11062	1 ⊢ (𝜑 → (abs‘((𝐴 · (log‘((𝑁 + 1) / 𝑁))) − (log‘((𝐴 / 𝑁) + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑁↑2))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∀wral 3063 {crab 3067 ∖ cdif 3880 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 · cmul 10807 < clt 10940 ≤ cle 10941 − cmin 11135 / cdiv 11562 ℕcn 11903 2c2 11958 ℕ₀cn0 12163 ℤcz 12249 ℝ⁺crp 12659 ↑cexp 13710 abscabs 14873 logclog 25615

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 ax-addf 10881 ax-mulf 10882

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-iin 4924 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-supp 7949 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-map 8575 df-pm 8576 df-ixp 8644 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fsupp 9059 df-fi 9100 df-sup 9131 df-inf 9132 df-oi 9199 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-q 12618 df-rp 12660 df-xneg 12777 df-xadd 12778 df-xmul 12779 df-ioo 13012 df-ioc 13013 df-ico 13014 df-icc 13015 df-fz 13169 df-fzo 13312 df-fl 13440 df-mod 13518 df-seq 13650 df-exp 13711 df-fac 13916 df-bc 13945 df-hash 13973 df-shft 14706 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-limsup 15108 df-clim 15125 df-rlim 15126 df-sum 15326 df-ef 15705 df-sin 15707 df-cos 15708 df-tan 15709 df-pi 15710 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-starv 16903 df-sca 16904 df-vsca 16905 df-ip 16906 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-hom 16912 df-cco 16913 df-rest 17050 df-topn 17051 df-0g 17069 df-gsum 17070 df-topgen 17071 df-pt 17072 df-prds 17075 df-xrs 17130 df-qtop 17135 df-imas 17136 df-xps 17138 df-mre 17212 df-mrc 17213 df-acs 17215 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-submnd 18346 df-mulg 18616 df-cntz 18838 df-cmn 19303 df-psmet 20502 df-xmet 20503 df-met 20504 df-bl 20505 df-mopn 20506 df-fbas 20507 df-fg 20508 df-cnfld 20511 df-top 21951 df-topon 21968 df-topsp 21990 df-bases 22004 df-cld 22078 df-ntr 22079 df-cls 22080 df-nei 22157 df-lp 22195 df-perf 22196 df-cn 22286 df-cnp 22287 df-haus 22374 df-cmp 22446 df-tx 22621 df-hmeo 22814 df-fil 22905 df-fm 22997 df-flim 22998 df-flf 22999 df-xms 23381 df-ms 23382 df-tms 23383 df-cncf 23947 df-limc 24935 df-dv 24936 df-log 25617

This theorem is referenced by: lgamgulmlem5 26087

W3C validator