lgamgulmlem5 - Metamath Proof Explorer

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

Theorem lgamgulmlem5 27393

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

**Hypotheses**
Ref	Expression
lgamgulm.r	⊢ (𝜑 → 𝑅 ∈ ℕ)
lgamgulm.u	⊢ 𝑈 = {𝑥 ∈ ℂ ∣ ((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)))}
lgamgulm.g	⊢ 𝐺 = (𝑚 ∈ ℕ ↦ (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑚 + 1) / 𝑚))) − (log‘((𝑧 / 𝑚) + 1)))))
lgamgulm.t	⊢ 𝑇 = (𝑚 ∈ ℕ ↦ if((2 · 𝑅) ≤ 𝑚, (𝑅 · ((2 · (𝑅 + 1)) / (𝑚↑2))), ((𝑅 · (log‘((𝑚 + 1) / 𝑚))) + ((log‘((𝑅 + 1) · 𝑚)) + π))))

**Assertion**
Ref	Expression
lgamgulmlem5	⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝐺‘𝑛)‘𝑦)) ≤ (𝑇‘𝑛))

Distinct variable groups: 𝑦,𝑛,𝐺 𝑥,𝑦 𝑘,𝑚,𝑛,𝑥,𝑦,𝑧,𝑅 𝑈,𝑚,𝑛,𝑦,𝑧 𝜑,𝑚,𝑛,𝑥,𝑦,𝑧 𝑇,𝑛,𝑦 Allowed substitution hints: 𝜑(𝑘) 𝑇(𝑥, 𝑧, 𝑘, 𝑚) 𝑈(𝑥, 𝑘) 𝐺(𝑥, 𝑧, 𝑘, 𝑚)

Proof of Theorem lgamgulmlem5 Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 5110	. . 3 ⊢ ((𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))) = if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))) → ((abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))) ↔ (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))))
2		breq2 5110	. . 3 ⊢ (((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)) = if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))) → ((abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)) ↔ (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))))
3		lgamgulm.r	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ ℕ)
4	3	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ∈ ℕ)
5	4	adantr 486	. . . 4 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → 𝑅 ∈ ℕ)
6		lgamgulm.u	. . . . 5 ⊢ 𝑈 = {𝑥 ∈ ℂ ∣ ((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)))}
7		fveq2 6911	. . . . . . . 8 ⊢ (𝑥 = 𝑡 → (abs‘𝑥) = (abs‘𝑡))
8	7	breq1d 5116	. . . . . . 7 ⊢ (𝑥 = 𝑡 → ((abs‘𝑥) ≤ 𝑅 ↔ (abs‘𝑡) ≤ 𝑅))
9		fvoveq1 7469	. . . . . . . . 9 ⊢ (𝑥 = 𝑡 → (abs‘(𝑥 + 𝑘)) = (abs‘(𝑡 + 𝑘)))
10	9	breq2d 5118	. . . . . . . 8 ⊢ (𝑥 = 𝑡 → ((1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘))))
11	10	ralbidv 3189	. . . . . . 7 ⊢ (𝑥 = 𝑡 → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘))))
12	8, 11	anbi12d 644	. . . . . 6 ⊢ (𝑥 = 𝑡 → (((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘))) ↔ ((abs‘𝑡) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘)))))
13	12	cbvrabv 3426	. . . . 5 ⊢ {𝑥 ∈ ℂ ∣ ((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)))} = {𝑡 ∈ ℂ ∣ ((abs‘𝑡) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘)))}
14	6, 13	eqtri 2786	. . . 4 ⊢ 𝑈 = {𝑡 ∈ ℂ ∣ ((abs‘𝑡) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘)))}
15		simplrl 789	. . . 4 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → 𝑛 ∈ ℕ)
16		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝑈)
17	16	adantr 486	. . . 4 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → 𝑦 ∈ 𝑈)
18		simpr 490	. . . 4 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → (2 · 𝑅) ≤ 𝑛)
19	5, 14, 15, 17, 18	lgamgulmlem3 27391	. . 3 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))))
20	3, 6	lgamgulmlem1 27389	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑈 ⊆ (ℂ ∖ (ℤ ∖ ℕ)))
21	20	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑈 ⊆ (ℂ ∖ (ℤ ∖ ℕ)))
22	21, 16	sseldd 3914	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ (ℂ ∖ (ℤ ∖ ℕ)))
23	22	eldifad 4054	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ ℂ)
24		simprl 783	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℕ)
25	24	peano2nnd 12382	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑛 + 1) ∈ ℕ)
26	25	nnrpd 13192	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑛 + 1) ∈ ℝ⁺)
27	24	nnrpd 13192	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℝ⁺)
28	26, 27	rpdivcld 13211	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑛 + 1) / 𝑛) ∈ ℝ⁺)
29	28	relogcld 26984	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘((𝑛 + 1) / 𝑛)) ∈ ℝ)
30	29	recnd 11367	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘((𝑛 + 1) / 𝑛)) ∈ ℂ)
31	23, 30	mulcld 11359	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑦 · (log‘((𝑛 + 1) / 𝑛))) ∈ ℂ)
32	24	nncnd 12381	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℂ)
33	24	nnne0d 12418	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ≠ 0)
34	23, 32, 33	divcld 12123	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑦 / 𝑛) ∈ ℂ)
35		1cnd 11332	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℂ)
36	34, 35	addcld 11358	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 / 𝑛) + 1) ∈ ℂ)
37	22, 24	dmgmdivn0 27388	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 / 𝑛) + 1) ≠ 0)
38	36, 37	logcld 26931	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘((𝑦 / 𝑛) + 1)) ∈ ℂ)
39	31, 38	subcld 11699	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))) ∈ ℂ)
40	39	abscld 15638	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ∈ ℝ)
41	31	abscld 15638	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) ∈ ℝ)
42	38	abscld 15638	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘((𝑦 / 𝑛) + 1))) ∈ ℝ)
43	41, 42	readdcld 11368	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) + (abs‘(log‘((𝑦 / 𝑛) + 1)))) ∈ ℝ)
44	4	nnred 12380	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ∈ ℝ)
45	44, 29	remulcld 11369	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 · (log‘((𝑛 + 1) / 𝑛))) ∈ ℝ)
46	4	peano2nnd 12382	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ∈ ℕ)
47	46	nnrpd 13192	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ∈ ℝ⁺)
48	47, 27	rpmulcld 13210	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑅 + 1) · 𝑛) ∈ ℝ⁺)
49	48	relogcld 26984	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘((𝑅 + 1) · 𝑛)) ∈ ℝ)
50		pire 26816	. . . . . . . 8 ⊢ π ∈ ℝ
51	50	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → π ∈ ℝ)
52	49, 51	readdcld 11368	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((log‘((𝑅 + 1) · 𝑛)) + π) ∈ ℝ)
53	45, 52	readdcld 11368	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)) ∈ ℝ)
54	31, 38	abs2dif2d 15660	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ ((abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) + (abs‘(log‘((𝑦 / 𝑛) + 1)))))
55	23, 30	absmuld 15656	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) = ((abs‘𝑦) · (abs‘(log‘((𝑛 + 1) / 𝑛)))))
56	28	rpred 13194	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑛 + 1) / 𝑛) ∈ ℝ)
57	32	mullidd 11357	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 · 𝑛) = 𝑛)
58	24	nnred 12380	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℝ)
59	58	lep1d 12278	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ≤ (𝑛 + 1))
60	57, 59	eqbrtrd 5131	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 · 𝑛) ≤ (𝑛 + 1))
61		1red 11339	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℝ)
62	58, 61	readdcld 11368	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑛 + 1) ∈ ℝ)
63	61, 62, 27	lemuldivd 13243	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((1 · 𝑛) ≤ (𝑛 + 1) ↔ 1 ≤ ((𝑛 + 1) / 𝑛)))
64	60, 63	mpbid 235	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ≤ ((𝑛 + 1) / 𝑛))
65	56, 64	logge0d 26991	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ (log‘((𝑛 + 1) / 𝑛)))
66	29, 65	absidd 15622	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘((𝑛 + 1) / 𝑛))) = (log‘((𝑛 + 1) / 𝑛)))
67	66	oveq2d 7462	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) · (abs‘(log‘((𝑛 + 1) / 𝑛)))) = ((abs‘𝑦) · (log‘((𝑛 + 1) / 𝑛))))
68	55, 67	eqtrd 2798	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) = ((abs‘𝑦) · (log‘((𝑛 + 1) / 𝑛))))
69	23	abscld 15638	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘𝑦) ∈ ℝ)
70		fveq2 6911	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → (abs‘𝑥) = (abs‘𝑦))
71	70	breq1d 5116	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((abs‘𝑥) ≤ 𝑅 ↔ (abs‘𝑦) ≤ 𝑅))
72		fvoveq1 7469	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → (abs‘(𝑥 + 𝑘)) = (abs‘(𝑦 + 𝑘)))
73	72	breq2d 5118	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → ((1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘))))
74	73	ralbidv 3189	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘))))
75	71, 74	anbi12d 644	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → (((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘))) ↔ ((abs‘𝑦) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)))))
76	75, 6	elrab2 3652	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑈 ↔ (𝑦 ∈ ℂ ∧ ((abs‘𝑦) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)))))
77	76	simprbi 503	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝑈 → ((abs‘𝑦) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘))))
78	77	ad2antll 742	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘))))
79	78	simpld 500	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘𝑦) ≤ 𝑅)
80	69, 44, 29, 65, 79	lemul1ad 12286	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) · (log‘((𝑛 + 1) / 𝑛))) ≤ (𝑅 · (log‘((𝑛 + 1) / 𝑛))))
81	68, 80	eqbrtrd 5131	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) ≤ (𝑅 · (log‘((𝑛 + 1) / 𝑛))))
82	36, 37	absrpcld 15650	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ∈ ℝ⁺)
83	82	relogcld 26984	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(abs‘((𝑦 / 𝑛) + 1))) ∈ ℝ)
84	83	recnd 11367	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(abs‘((𝑦 / 𝑛) + 1))) ∈ ℂ)
85	84	abscld 15638	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) ∈ ℝ)
86	85, 51	readdcld 11368	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) + π) ∈ ℝ)
87		abslogle 26979	. . . . . . . 8 ⊢ ((((𝑦 / 𝑛) + 1) ∈ ℂ ∧ ((𝑦 / 𝑛) + 1) ≠ 0) → (abs‘(log‘((𝑦 / 𝑛) + 1))) ≤ ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) + π))
88	36, 37, 87	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘((𝑦 / 𝑛) + 1))) ≤ ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) + π))
89		1rp 13154	. . . . . . . . . . . 12 ⊢ 1 ∈ ℝ⁺
90		relogdiv 26954	. . . . . . . . . . . 12 ⊢ ((1 ∈ ℝ⁺ ∧ ((𝑅 + 1) · 𝑛) ∈ ℝ⁺) → (log‘(1 / ((𝑅 + 1) · 𝑛))) = ((log‘1) − (log‘((𝑅 + 1) · 𝑛))))
91	89, 48, 90	sylancr 599	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(1 / ((𝑅 + 1) · 𝑛))) = ((log‘1) − (log‘((𝑅 + 1) · 𝑛))))
92		log1 26946	. . . . . . . . . . . . 13 ⊢ (log‘1) = 0
93	92	oveq1i 7456	. . . . . . . . . . . 12 ⊢ ((log‘1) − (log‘((𝑅 + 1) · 𝑛))) = (0 − (log‘((𝑅 + 1) · 𝑛)))
94		df-neg 11574	. . . . . . . . . . . 12 ⊢ -(log‘((𝑅 + 1) · 𝑛)) = (0 − (log‘((𝑅 + 1) · 𝑛)))
95	93, 94	eqtr4i 2789	. . . . . . . . . . 11 ⊢ ((log‘1) − (log‘((𝑅 + 1) · 𝑛))) = -(log‘((𝑅 + 1) · 𝑛))
96	91, 95	eqtr2di 2815	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → -(log‘((𝑅 + 1) · 𝑛)) = (log‘(1 / ((𝑅 + 1) · 𝑛))))
97	46	nnrecred 12419	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑅 + 1)) ∈ ℝ)
98	23, 32	addcld 11358	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑦 + 𝑛) ∈ ℂ)
99	98	abscld 15638	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 + 𝑛)) ∈ ℝ)
100	4	nnrecred 12419	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / 𝑅) ∈ ℝ)
101	4	nnrpd 13192	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ∈ ℝ⁺)
102		0le1 11869	. . . . . . . . . . . . . . . 16 ⊢ 0 ≤ 1
103	102	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ 1)
104	44	lep1d 12278	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ≤ (𝑅 + 1))
105	101, 47, 61, 103, 104	lediv2ad 13216	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑅 + 1)) ≤ (1 / 𝑅))
106		oveq2 7454	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑛 → (𝑦 + 𝑘) = (𝑦 + 𝑛))
107	106	fveq2d 6915	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑛 → (abs‘(𝑦 + 𝑘)) = (abs‘(𝑦 + 𝑛)))
108	107	breq2d 5118	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑛 → ((1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑛))))
109	78	simprd 501	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)))
110	24	nnnn0d 12697	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℕ₀)
111	108, 109, 110	rspcdva 3581	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑛)))
112	97, 100, 99, 105, 111	letrd 11497	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑅 + 1)) ≤ (abs‘(𝑦 + 𝑛)))
113	97, 99, 27, 112	lediv1dd 13252	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((1 / (𝑅 + 1)) / 𝑛) ≤ ((abs‘(𝑦 + 𝑛)) / 𝑛))
114	46	nncnd 12381	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ∈ ℂ)
115	46	nnne0d 12418	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ≠ 0)
116	114, 32, 115, 33	recdiv2d 12141	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((1 / (𝑅 + 1)) / 𝑛) = (1 / ((𝑅 + 1) · 𝑛)))
117	23, 32, 32, 33	divdird 12161	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 + 𝑛) / 𝑛) = ((𝑦 / 𝑛) + (𝑛 / 𝑛)))
118	32, 33	dividd 12121	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑛 / 𝑛) = 1)
119	118	oveq2d 7462	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 / 𝑛) + (𝑛 / 𝑛)) = ((𝑦 / 𝑛) + 1))
120	117, 119	eqtr2d 2799	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 / 𝑛) + 1) = ((𝑦 + 𝑛) / 𝑛))
121	120	fveq2d 6915	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) = (abs‘((𝑦 + 𝑛) / 𝑛)))
122	98, 32, 33	absdivd 15657	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 + 𝑛) / 𝑛)) = ((abs‘(𝑦 + 𝑛)) / (abs‘𝑛)))
123	27	rpge0d 13198	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ 𝑛)
124	58, 123	absidd 15622	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘𝑛) = 𝑛)
125	124	oveq2d 7462	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 + 𝑛)) / (abs‘𝑛)) = ((abs‘(𝑦 + 𝑛)) / 𝑛))
126	121, 122, 125	3eqtrrd 2803	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 + 𝑛)) / 𝑛) = (abs‘((𝑦 / 𝑛) + 1)))
127	113, 116, 126	3brtr3d 5140	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / ((𝑅 + 1) · 𝑛)) ≤ (abs‘((𝑦 / 𝑛) + 1)))
128	48	rpreccld 13204	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / ((𝑅 + 1) · 𝑛)) ∈ ℝ⁺)
129	128, 82	logled 26988	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((1 / ((𝑅 + 1) · 𝑛)) ≤ (abs‘((𝑦 / 𝑛) + 1)) ↔ (log‘(1 / ((𝑅 + 1) · 𝑛))) ≤ (log‘(abs‘((𝑦 / 𝑛) + 1)))))
130	127, 129	mpbid 235	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(1 / ((𝑅 + 1) · 𝑛))) ≤ (log‘(abs‘((𝑦 / 𝑛) + 1))))
131	96, 130	eqbrtrd 5131	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → -(log‘((𝑅 + 1) · 𝑛)) ≤ (log‘(abs‘((𝑦 / 𝑛) + 1))))
132	36	abscld 15638	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ∈ ℝ)
133	44, 61	readdcld 11368	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ∈ ℝ)
134	48	rpred 13194	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑅 + 1) · 𝑛) ∈ ℝ)
135	34	abscld 15638	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 / 𝑛)) ∈ ℝ)
136	135, 61	readdcld 11368	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 / 𝑛)) + 1) ∈ ℝ)
137	34, 35	abstrid 15658	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ≤ ((abs‘(𝑦 / 𝑛)) + (abs‘1)))
138		abs1 15496	. . . . . . . . . . . . . 14 ⊢ (abs‘1) = 1
139	138	oveq2i 7457	. . . . . . . . . . . . 13 ⊢ ((abs‘(𝑦 / 𝑛)) + (abs‘1)) = ((abs‘(𝑦 / 𝑛)) + 1)
140	137, 139	breqtrdi 5150	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ≤ ((abs‘(𝑦 / 𝑛)) + 1))
141	89	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℝ⁺)
142	23	absge0d 15646	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ (abs‘𝑦))
143	24	nnge1d 12416	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ≤ 𝑛)
144	69, 44, 141, 58, 142, 79, 143	lediv12ad 13253	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) / 𝑛) ≤ (𝑅 / 1))
145	23, 32, 33	absdivd 15657	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 / 𝑛)) = ((abs‘𝑦) / (abs‘𝑛)))
146	124	oveq2d 7462	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) / (abs‘𝑛)) = ((abs‘𝑦) / 𝑛))
147	145, 146	eqtr2d 2799	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) / 𝑛) = (abs‘(𝑦 / 𝑛)))
148	4	nncnd 12381	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ∈ ℂ)
149	148	div1d 12115	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 / 1) = 𝑅)
150	144, 147, 149	3brtr3d 5140	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 / 𝑛)) ≤ 𝑅)
151	135, 44, 61, 150	leadd1dd 11960	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 / 𝑛)) + 1) ≤ (𝑅 + 1))
152	132, 136, 133, 140, 151	letrd 11497	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ≤ (𝑅 + 1))
153	47	rpge0d 13198	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ (𝑅 + 1))
154	133, 58, 153, 143	lemulge11d 12284	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ≤ ((𝑅 + 1) · 𝑛))
155	132, 133, 134, 152, 154	letrd 11497	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ≤ ((𝑅 + 1) · 𝑛))
156	82, 48	logled 26988	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘((𝑦 / 𝑛) + 1)) ≤ ((𝑅 + 1) · 𝑛) ↔ (log‘(abs‘((𝑦 / 𝑛) + 1))) ≤ (log‘((𝑅 + 1) · 𝑛))))
157	155, 156	mpbid 235	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(abs‘((𝑦 / 𝑛) + 1))) ≤ (log‘((𝑅 + 1) · 𝑛)))
158	83, 49	absled 15632	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) ≤ (log‘((𝑅 + 1) · 𝑛)) ↔ ( -(log‘((𝑅 + 1) · 𝑛)) ≤ (log‘(abs‘((𝑦 / 𝑛) + 1))) ∧ (log‘(abs‘((𝑦 / 𝑛) + 1))) ≤ (log‘((𝑅 + 1) · 𝑛)))))
159	131, 157, 158	mpbir2and 726	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) ≤ (log‘((𝑅 + 1) · 𝑛)))
160	85, 49, 51, 159	leadd1dd 11960	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) + π) ≤ ((log‘((𝑅 + 1) · 𝑛)) + π))
161	42, 86, 52, 88, 160	letrd 11497	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘((𝑦 / 𝑛) + 1))) ≤ ((log‘((𝑅 + 1) · 𝑛)) + π))
162	41, 42, 45, 52, 81, 161	le2addd 11965	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) + (abs‘(log‘((𝑦 / 𝑛) + 1)))) ≤ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))
163	40, 43, 53, 54, 162	letrd 11497	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))
164	163	adantr 486	. . 3 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ ¬ (2 · 𝑅) ≤ 𝑛) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))
165	1, 2, 19, 164	ifbothda 4524	. 2 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))))
166		oveq1 7453	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → (𝑚 + 1) = (𝑛 + 1))
167		id 23	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → 𝑚 = 𝑛)
168	166, 167	oveq12d 7464	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → ((𝑚 + 1) / 𝑚) = ((𝑛 + 1) / 𝑛))
169	168	fveq2d 6915	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → (log‘((𝑚 + 1) / 𝑚)) = (log‘((𝑛 + 1) / 𝑛)))
170	169	oveq2d 7462	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (𝑧 · (log‘((𝑚 + 1) / 𝑚))) = (𝑧 · (log‘((𝑛 + 1) / 𝑛))))
171		oveq2 7454	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → (𝑧 / 𝑚) = (𝑧 / 𝑛))
172	171	fvoveq1d 7468	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (log‘((𝑧 / 𝑚) + 1)) = (log‘((𝑧 / 𝑛) + 1)))
173	170, 172	oveq12d 7464	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → ((𝑧 · (log‘((𝑚 + 1) / 𝑚))) − (log‘((𝑧 / 𝑚) + 1))) = ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))
174	173	mpteq2dv 5203	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑚 + 1) / 𝑚))) − (log‘((𝑧 / 𝑚) + 1)))) = (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))))
175		lgamgulm.g	. . . . . . 7 ⊢ 𝐺 = (𝑚 ∈ ℕ ↦ (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑚 + 1) / 𝑚))) − (log‘((𝑧 / 𝑚) + 1)))))
176		cnex 11311	. . . . . . . . 9 ⊢ ℂ ∈ V
177	6, 176	rabex2 5307	. . . . . . . 8 ⊢ 𝑈 ∈ V
178	177	mptex 7255	. . . . . . 7 ⊢ (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))) ∈ V
179	174, 175, 178	fvmpt 7019	. . . . . 6 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))))
180	179	ad2antrl 741	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝐺‘𝑛) = (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))))
181	180	fveq1d 6913	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝐺‘𝑛)‘𝑦) = ((𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))‘𝑦))
182		oveq1 7453	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑧 · (log‘((𝑛 + 1) / 𝑛))) = (𝑦 · (log‘((𝑛 + 1) / 𝑛))))
183		oveq1 7453	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑧 / 𝑛) = (𝑦 / 𝑛))
184	183	fvoveq1d 7468	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (log‘((𝑧 / 𝑛) + 1)) = (log‘((𝑦 / 𝑛) + 1)))
185	182, 184	oveq12d 7464	. . . . . 6 ⊢ (𝑧 = 𝑦 → ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))) = ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))))
186		eqid 2763	. . . . . 6 ⊢ (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))) = (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))
187		ovex 7479	. . . . . 6 ⊢ ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))) ∈ V
188	185, 186, 187	fvmpt 7019	. . . . 5 ⊢ (𝑦 ∈ 𝑈 → ((𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))‘𝑦) = ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))))
189	188	ad2antll 742	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))‘𝑦) = ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))))
190	181, 189	eqtrd 2798	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝐺‘𝑛)‘𝑦) = ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))))
191	190	fveq2d 6915	. 2 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝐺‘𝑛)‘𝑦)) = (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))))
192		breq2 5110	. . . . 5 ⊢ (𝑚 = 𝑛 → ((2 · 𝑅) ≤ 𝑚 ↔ (2 · 𝑅) ≤ 𝑛))
193		oveq1 7453	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (𝑚↑2) = (𝑛↑2))
194	193	oveq2d 7462	. . . . . 6 ⊢ (𝑚 = 𝑛 → ((2 · (𝑅 + 1)) / (𝑚↑2)) = ((2 · (𝑅 + 1)) / (𝑛↑2)))
195	194	oveq2d 7462	. . . . 5 ⊢ (𝑚 = 𝑛 → (𝑅 · ((2 · (𝑅 + 1)) / (𝑚↑2))) = (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))))
196	169	oveq2d 7462	. . . . . 6 ⊢ (𝑚 = 𝑛 → (𝑅 · (log‘((𝑚 + 1) / 𝑚))) = (𝑅 · (log‘((𝑛 + 1) / 𝑛))))
197		oveq2 7454	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → ((𝑅 + 1) · 𝑚) = ((𝑅 + 1) · 𝑛))
198	197	fveq2d 6915	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (log‘((𝑅 + 1) · 𝑚)) = (log‘((𝑅 + 1) · 𝑛)))
199	198	oveq1d 7461	. . . . . 6 ⊢ (𝑚 = 𝑛 → ((log‘((𝑅 + 1) · 𝑚)) + π) = ((log‘((𝑅 + 1) · 𝑛)) + π))
200	196, 199	oveq12d 7464	. . . . 5 ⊢ (𝑚 = 𝑛 → ((𝑅 · (log‘((𝑚 + 1) / 𝑚))) + ((log‘((𝑅 + 1) · 𝑚)) + π)) = ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))
201	192, 195, 200	ifbieq12d 4514	. . . 4 ⊢ (𝑚 = 𝑛 → if((2 · 𝑅) ≤ 𝑚, (𝑅 · ((2 · (𝑅 + 1)) / (𝑚↑2))), ((𝑅 · (log‘((𝑚 + 1) / 𝑚))) + ((log‘((𝑅 + 1) · 𝑚)) + π))) = if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))))
202		lgamgulm.t	. . . 4 ⊢ 𝑇 = (𝑚 ∈ ℕ ↦ if((2 · 𝑅) ≤ 𝑚, (𝑅 · ((2 · (𝑅 + 1)) / (𝑚↑2))), ((𝑅 · (log‘((𝑚 + 1) / 𝑚))) + ((log‘((𝑅 + 1) · 𝑚)) + π))))
203		ovex 7479	. . . . 5 ⊢ (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))) ∈ V
204		ovex 7479	. . . . 5 ⊢ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)) ∈ V
205	203, 204	ifex 4536	. . . 4 ⊢ if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))) ∈ V
206	201, 202, 205	fvmpt 7019	. . 3 ⊢ (𝑛 ∈ ℕ → (𝑇‘𝑛) = if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))))
207	206	ad2antrl 741	. 2 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑇‘𝑛) = if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))))
208	165, 191, 207	3brtr4d 5141	1 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝐺‘𝑛)‘𝑦)) ≤ (𝑇‘𝑛))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 {crab 3416 ⊆ wss 3900 ∖ cdif 4048 ifcif 4485 class class class wbr 5106 ↦ cmpt 5190 ‘cfv 6561 (class class class)co 7446 ℂcc 11228 ℝcr 11229 0cc0 11230 1c1 11231 + caddc 11233 · cmul 11235 ≤ cle 11374 − cmin 11571 -cneg 11572 / cdiv 12003 ℕcn 12365 2c2 12427 ℕ₀cn0 12636 ℤcz 12723 ℝ⁺crp 13150 ↑cexp 14234 abscabs 15433 πcpi 16264 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: lgamgulmlem6 27394

W3C validator