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 24559

Description: Lemma for lgamgulm 24561. (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 4587	. . 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 4587	. . 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 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ∈ ℕ)
5	4	adantr 480	. . . 4 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → 𝑅 ∈ ℕ)
6		lgamgulm.u	. . . . 5 ⊢ 𝑈 = {𝑥 ∈ ℂ ∣ ((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)))}
7		fveq2 6103	. . . . . . . 8 ⊢ (𝑥 = 𝑡 → (abs‘𝑥) = (abs‘𝑡))
8	7	breq1d 4593	. . . . . . 7 ⊢ (𝑥 = 𝑡 → ((abs‘𝑥) ≤ 𝑅 ↔ (abs‘𝑡) ≤ 𝑅))
9		oveq1 6556	. . . . . . . . . 10 ⊢ (𝑥 = 𝑡 → (𝑥 + 𝑘) = (𝑡 + 𝑘))
10	9	fveq2d 6107	. . . . . . . . 9 ⊢ (𝑥 = 𝑡 → (abs‘(𝑥 + 𝑘)) = (abs‘(𝑡 + 𝑘)))
11	10	breq2d 4595	. . . . . . . 8 ⊢ (𝑥 = 𝑡 → ((1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘))))
12	11	ralbidv 2969	. . . . . . 7 ⊢ (𝑥 = 𝑡 → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘))))
13	8, 12	anbi12d 743	. . . . . 6 ⊢ (𝑥 = 𝑡 → (((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘))) ↔ ((abs‘𝑡) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘)))))
14	13	cbvrabv 3172	. . . . 5 ⊢ {𝑥 ∈ ℂ ∣ ((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)))} = {𝑡 ∈ ℂ ∣ ((abs‘𝑡) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘)))}
15	6, 14	eqtri 2632	. . . 4 ⊢ 𝑈 = {𝑡 ∈ ℂ ∣ ((abs‘𝑡) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑡 + 𝑘)))}
16		simplrl 796	. . . 4 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → 𝑛 ∈ ℕ)
17		simprr 792	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝑈)
18	17	adantr 480	. . . 4 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → 𝑦 ∈ 𝑈)
19		simpr 476	. . . 4 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → (2 · 𝑅) ≤ 𝑛)
20	5, 15, 16, 18, 19	lgamgulmlem3 24557	. . 3 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ (2 · 𝑅) ≤ 𝑛) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))))
21	3, 6	lgamgulmlem1 24555	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑈 ⊆ (ℂ ∖ (ℤ ∖ ℕ)))
22	21	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑈 ⊆ (ℂ ∖ (ℤ ∖ ℕ)))
23	22, 17	sseldd 3569	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ (ℂ ∖ (ℤ ∖ ℕ)))
24	23	eldifad 3552	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ ℂ)
25		simprl 790	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℕ)
26	25	peano2nnd 10914	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑛 + 1) ∈ ℕ)
27	26	nnrpd 11746	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑛 + 1) ∈ ℝ⁺)
28	25	nnrpd 11746	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℝ⁺)
29	27, 28	rpdivcld 11765	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑛 + 1) / 𝑛) ∈ ℝ⁺)
30	29	relogcld 24173	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘((𝑛 + 1) / 𝑛)) ∈ ℝ)
31	30	recnd 9947	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘((𝑛 + 1) / 𝑛)) ∈ ℂ)
32	24, 31	mulcld 9939	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑦 · (log‘((𝑛 + 1) / 𝑛))) ∈ ℂ)
33	25	nncnd 10913	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℂ)
34	25	nnne0d 10942	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ≠ 0)
35	24, 33, 34	divcld 10680	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑦 / 𝑛) ∈ ℂ)
36		1cnd 9935	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℂ)
37	35, 36	addcld 9938	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 / 𝑛) + 1) ∈ ℂ)
38	23, 25	dmgmdivn0 24554	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 / 𝑛) + 1) ≠ 0)
39	37, 38	logcld 24121	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘((𝑦 / 𝑛) + 1)) ∈ ℂ)
40	32, 39	subcld 10271	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))) ∈ ℂ)
41	40	abscld 14023	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ∈ ℝ)
42	32	abscld 14023	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) ∈ ℝ)
43	39	abscld 14023	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘((𝑦 / 𝑛) + 1))) ∈ ℝ)
44	42, 43	readdcld 9948	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) + (abs‘(log‘((𝑦 / 𝑛) + 1)))) ∈ ℝ)
45	4	nnred 10912	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ∈ ℝ)
46	45, 30	remulcld 9949	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 · (log‘((𝑛 + 1) / 𝑛))) ∈ ℝ)
47	4	peano2nnd 10914	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ∈ ℕ)
48	47	nnrpd 11746	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ∈ ℝ⁺)
49	48, 28	rpmulcld 11764	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑅 + 1) · 𝑛) ∈ ℝ⁺)
50	49	relogcld 24173	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘((𝑅 + 1) · 𝑛)) ∈ ℝ)
51		pire 24014	. . . . . . . 8 ⊢ π ∈ ℝ
52	51	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → π ∈ ℝ)
53	50, 52	readdcld 9948	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((log‘((𝑅 + 1) · 𝑛)) + π) ∈ ℝ)
54	46, 53	readdcld 9948	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)) ∈ ℝ)
55	32, 39	abs2dif2d 14045	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ ((abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) + (abs‘(log‘((𝑦 / 𝑛) + 1)))))
56	24, 31	absmuld 14041	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) = ((abs‘𝑦) · (abs‘(log‘((𝑛 + 1) / 𝑛)))))
57	29	rpred 11748	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑛 + 1) / 𝑛) ∈ ℝ)
58	33	mulid2d 9937	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 · 𝑛) = 𝑛)
59	25	nnred 10912	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℝ)
60	59	lep1d 10834	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ≤ (𝑛 + 1))
61	58, 60	eqbrtrd 4605	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 · 𝑛) ≤ (𝑛 + 1))
62		1red 9934	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℝ)
63	59, 62	readdcld 9948	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑛 + 1) ∈ ℝ)
64	62, 63, 28	lemuldivd 11797	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((1 · 𝑛) ≤ (𝑛 + 1) ↔ 1 ≤ ((𝑛 + 1) / 𝑛)))
65	61, 64	mpbid 221	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ≤ ((𝑛 + 1) / 𝑛))
66	57, 65	logge0d 24180	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ (log‘((𝑛 + 1) / 𝑛)))
67	30, 66	absidd 14009	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘((𝑛 + 1) / 𝑛))) = (log‘((𝑛 + 1) / 𝑛)))
68	67	oveq2d 6565	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) · (abs‘(log‘((𝑛 + 1) / 𝑛)))) = ((abs‘𝑦) · (log‘((𝑛 + 1) / 𝑛))))
69	56, 68	eqtrd 2644	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) = ((abs‘𝑦) · (log‘((𝑛 + 1) / 𝑛))))
70	24	abscld 14023	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘𝑦) ∈ ℝ)
71		fveq2 6103	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → (abs‘𝑥) = (abs‘𝑦))
72	71	breq1d 4593	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((abs‘𝑥) ≤ 𝑅 ↔ (abs‘𝑦) ≤ 𝑅))
73		oveq1 6556	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → (𝑥 + 𝑘) = (𝑦 + 𝑘))
74	73	fveq2d 6107	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → (abs‘(𝑥 + 𝑘)) = (abs‘(𝑦 + 𝑘)))
75	74	breq2d 4595	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → ((1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘))))
76	75	ralbidv 2969	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘)) ↔ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘))))
77	72, 76	anbi12d 743	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → (((abs‘𝑥) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑥 + 𝑘))) ↔ ((abs‘𝑦) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)))))
78	77, 6	elrab2 3333	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑈 ↔ (𝑦 ∈ ℂ ∧ ((abs‘𝑦) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)))))
79	78	simprbi 479	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝑈 → ((abs‘𝑦) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘))))
80	79	ad2antll 761	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) ≤ 𝑅 ∧ ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘))))
81	80	simpld 474	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘𝑦) ≤ 𝑅)
82	70, 45, 30, 66, 81	lemul1ad 10842	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) · (log‘((𝑛 + 1) / 𝑛))) ≤ (𝑅 · (log‘((𝑛 + 1) / 𝑛))))
83	69, 82	eqbrtrd 4605	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) ≤ (𝑅 · (log‘((𝑛 + 1) / 𝑛))))
84	37, 38	absrpcld 14035	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ∈ ℝ⁺)
85	84	relogcld 24173	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(abs‘((𝑦 / 𝑛) + 1))) ∈ ℝ)
86	85	recnd 9947	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(abs‘((𝑦 / 𝑛) + 1))) ∈ ℂ)
87	86	abscld 14023	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) ∈ ℝ)
88	87, 52	readdcld 9948	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) + π) ∈ ℝ)
89		abslogle 24168	. . . . . . . 8 ⊢ ((((𝑦 / 𝑛) + 1) ∈ ℂ ∧ ((𝑦 / 𝑛) + 1) ≠ 0) → (abs‘(log‘((𝑦 / 𝑛) + 1))) ≤ ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) + π))
90	37, 38, 89	syl2anc 691	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘((𝑦 / 𝑛) + 1))) ≤ ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) + π))
91		1rp 11712	. . . . . . . . . . . 12 ⊢ 1 ∈ ℝ⁺
92		relogdiv 24143	. . . . . . . . . . . 12 ⊢ ((1 ∈ ℝ⁺ ∧ ((𝑅 + 1) · 𝑛) ∈ ℝ⁺) → (log‘(1 / ((𝑅 + 1) · 𝑛))) = ((log‘1) − (log‘((𝑅 + 1) · 𝑛))))
93	91, 49, 92	sylancr 694	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(1 / ((𝑅 + 1) · 𝑛))) = ((log‘1) − (log‘((𝑅 + 1) · 𝑛))))
94		log1 24136	. . . . . . . . . . . . 13 ⊢ (log‘1) = 0
95	94	oveq1i 6559	. . . . . . . . . . . 12 ⊢ ((log‘1) − (log‘((𝑅 + 1) · 𝑛))) = (0 − (log‘((𝑅 + 1) · 𝑛)))
96		df-neg 10148	. . . . . . . . . . . 12 ⊢ -(log‘((𝑅 + 1) · 𝑛)) = (0 − (log‘((𝑅 + 1) · 𝑛)))
97	95, 96	eqtr4i 2635	. . . . . . . . . . 11 ⊢ ((log‘1) − (log‘((𝑅 + 1) · 𝑛))) = -(log‘((𝑅 + 1) · 𝑛))
98	93, 97	syl6req 2661	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → -(log‘((𝑅 + 1) · 𝑛)) = (log‘(1 / ((𝑅 + 1) · 𝑛))))
99	47	nnrecred 10943	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑅 + 1)) ∈ ℝ)
100	24, 33	addcld 9938	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑦 + 𝑛) ∈ ℂ)
101	100	abscld 14023	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 + 𝑛)) ∈ ℝ)
102	4	nnrecred 10943	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / 𝑅) ∈ ℝ)
103	4	nnrpd 11746	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ∈ ℝ⁺)
104		0le1 10430	. . . . . . . . . . . . . . . 16 ⊢ 0 ≤ 1
105	104	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ 1)
106	45	lep1d 10834	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ≤ (𝑅 + 1))
107	103, 48, 62, 105, 106	lediv2ad 11770	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑅 + 1)) ≤ (1 / 𝑅))
108	25	nnnn0d 11228	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑛 ∈ ℕ₀)
109	80	simprd 478	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)))
110		oveq2 6557	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑛 → (𝑦 + 𝑘) = (𝑦 + 𝑛))
111	110	fveq2d 6107	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑛 → (abs‘(𝑦 + 𝑘)) = (abs‘(𝑦 + 𝑛)))
112	111	breq2d 4595	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑛 → ((1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)) ↔ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑛))))
113	112	rspcv 3278	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ₀ → (∀𝑘 ∈ ℕ₀ (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑘)) → (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑛))))
114	108, 109, 113	sylc 63	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / 𝑅) ≤ (abs‘(𝑦 + 𝑛)))
115	99, 102, 101, 107, 114	letrd 10073	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / (𝑅 + 1)) ≤ (abs‘(𝑦 + 𝑛)))
116	99, 101, 28, 115	lediv1dd 11806	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((1 / (𝑅 + 1)) / 𝑛) ≤ ((abs‘(𝑦 + 𝑛)) / 𝑛))
117	47	nncnd 10913	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ∈ ℂ)
118	47	nnne0d 10942	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ≠ 0)
119	117, 33, 118, 34	recdiv2d 10698	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((1 / (𝑅 + 1)) / 𝑛) = (1 / ((𝑅 + 1) · 𝑛)))
120	24, 33, 33, 34	divdird 10718	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 + 𝑛) / 𝑛) = ((𝑦 / 𝑛) + (𝑛 / 𝑛)))
121	33, 34	dividd 10678	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑛 / 𝑛) = 1)
122	121	oveq2d 6565	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 / 𝑛) + (𝑛 / 𝑛)) = ((𝑦 / 𝑛) + 1))
123	120, 122	eqtr2d 2645	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑦 / 𝑛) + 1) = ((𝑦 + 𝑛) / 𝑛))
124	123	fveq2d 6107	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) = (abs‘((𝑦 + 𝑛) / 𝑛)))
125	100, 33, 34	absdivd 14042	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 + 𝑛) / 𝑛)) = ((abs‘(𝑦 + 𝑛)) / (abs‘𝑛)))
126	28	rpge0d 11752	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ 𝑛)
127	59, 126	absidd 14009	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘𝑛) = 𝑛)
128	127	oveq2d 6565	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 + 𝑛)) / (abs‘𝑛)) = ((abs‘(𝑦 + 𝑛)) / 𝑛))
129	124, 125, 128	3eqtrrd 2649	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 + 𝑛)) / 𝑛) = (abs‘((𝑦 / 𝑛) + 1)))
130	116, 119, 129	3brtr3d 4614	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / ((𝑅 + 1) · 𝑛)) ≤ (abs‘((𝑦 / 𝑛) + 1)))
131	49	rpreccld 11758	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (1 / ((𝑅 + 1) · 𝑛)) ∈ ℝ⁺)
132	131, 84	logled 24177	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((1 / ((𝑅 + 1) · 𝑛)) ≤ (abs‘((𝑦 / 𝑛) + 1)) ↔ (log‘(1 / ((𝑅 + 1) · 𝑛))) ≤ (log‘(abs‘((𝑦 / 𝑛) + 1)))))
133	130, 132	mpbid 221	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(1 / ((𝑅 + 1) · 𝑛))) ≤ (log‘(abs‘((𝑦 / 𝑛) + 1))))
134	98, 133	eqbrtrd 4605	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → -(log‘((𝑅 + 1) · 𝑛)) ≤ (log‘(abs‘((𝑦 / 𝑛) + 1))))
135	37	abscld 14023	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ∈ ℝ)
136	45, 62	readdcld 9948	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ∈ ℝ)
137	49	rpred 11748	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑅 + 1) · 𝑛) ∈ ℝ)
138	35	abscld 14023	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 / 𝑛)) ∈ ℝ)
139	138, 62	readdcld 9948	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 / 𝑛)) + 1) ∈ ℝ)
140	35, 36	abstrid 14043	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ≤ ((abs‘(𝑦 / 𝑛)) + (abs‘1)))
141		abs1 13885	. . . . . . . . . . . . . 14 ⊢ (abs‘1) = 1
142	141	oveq2i 6560	. . . . . . . . . . . . 13 ⊢ ((abs‘(𝑦 / 𝑛)) + (abs‘1)) = ((abs‘(𝑦 / 𝑛)) + 1)
143	140, 142	syl6breq 4624	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ≤ ((abs‘(𝑦 / 𝑛)) + 1))
144	91	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ∈ ℝ⁺)
145	24	absge0d 14031	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ (abs‘𝑦))
146	25	nnge1d 10940	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 1 ≤ 𝑛)
147	70, 45, 144, 59, 145, 81, 146	lediv12ad 11807	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) / 𝑛) ≤ (𝑅 / 1))
148	24, 33, 34	absdivd 14042	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 / 𝑛)) = ((abs‘𝑦) / (abs‘𝑛)))
149	127	oveq2d 6565	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) / (abs‘𝑛)) = ((abs‘𝑦) / 𝑛))
150	148, 149	eqtr2d 2645	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘𝑦) / 𝑛) = (abs‘(𝑦 / 𝑛)))
151	4	nncnd 10913	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 𝑅 ∈ ℂ)
152	151	div1d 10672	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 / 1) = 𝑅)
153	147, 150, 152	3brtr3d 4614	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(𝑦 / 𝑛)) ≤ 𝑅)
154	138, 45, 62, 153	leadd1dd 10520	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 / 𝑛)) + 1) ≤ (𝑅 + 1))
155	135, 139, 136, 143, 154	letrd 10073	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ≤ (𝑅 + 1))
156	48	rpge0d 11752	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → 0 ≤ (𝑅 + 1))
157	136, 59, 156, 146	lemulge11d 10840	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑅 + 1) ≤ ((𝑅 + 1) · 𝑛))
158	135, 136, 137, 155, 157	letrd 10073	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 / 𝑛) + 1)) ≤ ((𝑅 + 1) · 𝑛))
159	84, 49	logled 24177	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘((𝑦 / 𝑛) + 1)) ≤ ((𝑅 + 1) · 𝑛) ↔ (log‘(abs‘((𝑦 / 𝑛) + 1))) ≤ (log‘((𝑅 + 1) · 𝑛))))
160	158, 159	mpbid 221	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (log‘(abs‘((𝑦 / 𝑛) + 1))) ≤ (log‘((𝑅 + 1) · 𝑛)))
161	85, 50	absled 14017	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) ≤ (log‘((𝑅 + 1) · 𝑛)) ↔ (-(log‘((𝑅 + 1) · 𝑛)) ≤ (log‘(abs‘((𝑦 / 𝑛) + 1))) ∧ (log‘(abs‘((𝑦 / 𝑛) + 1))) ≤ (log‘((𝑅 + 1) · 𝑛)))))
162	134, 160, 161	mpbir2and 959	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) ≤ (log‘((𝑅 + 1) · 𝑛)))
163	87, 50, 52, 162	leadd1dd 10520	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(log‘(abs‘((𝑦 / 𝑛) + 1)))) + π) ≤ ((log‘((𝑅 + 1) · 𝑛)) + π))
164	43, 88, 53, 90, 163	letrd 10073	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘(log‘((𝑦 / 𝑛) + 1))) ≤ ((log‘((𝑅 + 1) · 𝑛)) + π))
165	42, 43, 46, 53, 83, 164	le2addd 10525	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((abs‘(𝑦 · (log‘((𝑛 + 1) / 𝑛)))) + (abs‘(log‘((𝑦 / 𝑛) + 1)))) ≤ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))
166	41, 44, 54, 55, 165	letrd 10073	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))
167	166	adantr 480	. . 3 ⊢ (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) ∧ ¬ (2 · 𝑅) ≤ 𝑛) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))
168	1, 2, 20, 167	ifbothda 4073	. 2 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))) ≤ if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))))
169		oveq1 6556	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → (𝑚 + 1) = (𝑛 + 1))
170		id 22	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → 𝑚 = 𝑛)
171	169, 170	oveq12d 6567	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → ((𝑚 + 1) / 𝑚) = ((𝑛 + 1) / 𝑛))
172	171	fveq2d 6107	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → (log‘((𝑚 + 1) / 𝑚)) = (log‘((𝑛 + 1) / 𝑛)))
173	172	oveq2d 6565	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (𝑧 · (log‘((𝑚 + 1) / 𝑚))) = (𝑧 · (log‘((𝑛 + 1) / 𝑛))))
174		oveq2 6557	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (𝑧 / 𝑚) = (𝑧 / 𝑛))
175	174	oveq1d 6564	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → ((𝑧 / 𝑚) + 1) = ((𝑧 / 𝑛) + 1))
176	175	fveq2d 6107	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (log‘((𝑧 / 𝑚) + 1)) = (log‘((𝑧 / 𝑛) + 1)))
177	173, 176	oveq12d 6567	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → ((𝑧 · (log‘((𝑚 + 1) / 𝑚))) − (log‘((𝑧 / 𝑚) + 1))) = ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))
178	177	mpteq2dv 4673	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑚 + 1) / 𝑚))) − (log‘((𝑧 / 𝑚) + 1)))) = (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))))
179		lgamgulm.g	. . . . . . 7 ⊢ 𝐺 = (𝑚 ∈ ℕ ↦ (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑚 + 1) / 𝑚))) − (log‘((𝑧 / 𝑚) + 1)))))
180		cnex 9896	. . . . . . . . 9 ⊢ ℂ ∈ V
181	6, 180	rabex2 4742	. . . . . . . 8 ⊢ 𝑈 ∈ V
182	181	mptex 6390	. . . . . . 7 ⊢ (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))) ∈ V
183	178, 179, 182	fvmpt 6191	. . . . . 6 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))))
184	183	ad2antrl 760	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝐺‘𝑛) = (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))))
185	184	fveq1d 6105	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝐺‘𝑛)‘𝑦) = ((𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))‘𝑦))
186		oveq1 6556	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑧 · (log‘((𝑛 + 1) / 𝑛))) = (𝑦 · (log‘((𝑛 + 1) / 𝑛))))
187		oveq1 6556	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝑧 / 𝑛) = (𝑦 / 𝑛))
188	187	oveq1d 6564	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → ((𝑧 / 𝑛) + 1) = ((𝑦 / 𝑛) + 1))
189	188	fveq2d 6107	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (log‘((𝑧 / 𝑛) + 1)) = (log‘((𝑦 / 𝑛) + 1)))
190	186, 189	oveq12d 6567	. . . . . 6 ⊢ (𝑧 = 𝑦 → ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))) = ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))))
191		eqid 2610	. . . . . 6 ⊢ (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1)))) = (𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))
192		ovex 6577	. . . . . 6 ⊢ ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))) ∈ V
193	190, 191, 192	fvmpt 6191	. . . . 5 ⊢ (𝑦 ∈ 𝑈 → ((𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))‘𝑦) = ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))))
194	193	ad2antll 761	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝑧 ∈ 𝑈 ↦ ((𝑧 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑧 / 𝑛) + 1))))‘𝑦) = ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))))
195	185, 194	eqtrd 2644	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → ((𝐺‘𝑛)‘𝑦) = ((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1))))
196	195	fveq2d 6107	. 2 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝐺‘𝑛)‘𝑦)) = (abs‘((𝑦 · (log‘((𝑛 + 1) / 𝑛))) − (log‘((𝑦 / 𝑛) + 1)))))
197		breq2 4587	. . . . 5 ⊢ (𝑚 = 𝑛 → ((2 · 𝑅) ≤ 𝑚 ↔ (2 · 𝑅) ≤ 𝑛))
198		oveq1 6556	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (𝑚↑2) = (𝑛↑2))
199	198	oveq2d 6565	. . . . . 6 ⊢ (𝑚 = 𝑛 → ((2 · (𝑅 + 1)) / (𝑚↑2)) = ((2 · (𝑅 + 1)) / (𝑛↑2)))
200	199	oveq2d 6565	. . . . 5 ⊢ (𝑚 = 𝑛 → (𝑅 · ((2 · (𝑅 + 1)) / (𝑚↑2))) = (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))))
201	172	oveq2d 6565	. . . . . 6 ⊢ (𝑚 = 𝑛 → (𝑅 · (log‘((𝑚 + 1) / 𝑚))) = (𝑅 · (log‘((𝑛 + 1) / 𝑛))))
202		oveq2 6557	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → ((𝑅 + 1) · 𝑚) = ((𝑅 + 1) · 𝑛))
203	202	fveq2d 6107	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (log‘((𝑅 + 1) · 𝑚)) = (log‘((𝑅 + 1) · 𝑛)))
204	203	oveq1d 6564	. . . . . 6 ⊢ (𝑚 = 𝑛 → ((log‘((𝑅 + 1) · 𝑚)) + π) = ((log‘((𝑅 + 1) · 𝑛)) + π))
205	201, 204	oveq12d 6567	. . . . 5 ⊢ (𝑚 = 𝑛 → ((𝑅 · (log‘((𝑚 + 1) / 𝑚))) + ((log‘((𝑅 + 1) · 𝑚)) + π)) = ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)))
206	197, 200, 205	ifbieq12d 4063	. . . 4 ⊢ (𝑚 = 𝑛 → if((2 · 𝑅) ≤ 𝑚, (𝑅 · ((2 · (𝑅 + 1)) / (𝑚↑2))), ((𝑅 · (log‘((𝑚 + 1) / 𝑚))) + ((log‘((𝑅 + 1) · 𝑚)) + π))) = if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))))
207		lgamgulm.t	. . . 4 ⊢ 𝑇 = (𝑚 ∈ ℕ ↦ if((2 · 𝑅) ≤ 𝑚, (𝑅 · ((2 · (𝑅 + 1)) / (𝑚↑2))), ((𝑅 · (log‘((𝑚 + 1) / 𝑚))) + ((log‘((𝑅 + 1) · 𝑚)) + π))))
208		ovex 6577	. . . . 5 ⊢ (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))) ∈ V
209		ovex 6577	. . . . 5 ⊢ ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π)) ∈ V
210	208, 209	ifex 4106	. . . 4 ⊢ if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))) ∈ V
211	206, 207, 210	fvmpt 6191	. . 3 ⊢ (𝑛 ∈ ℕ → (𝑇‘𝑛) = if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))))
212	211	ad2antrl 760	. 2 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (𝑇‘𝑛) = if((2 · 𝑅) ≤ 𝑛, (𝑅 · ((2 · (𝑅 + 1)) / (𝑛↑2))), ((𝑅 · (log‘((𝑛 + 1) / 𝑛))) + ((log‘((𝑅 + 1) · 𝑛)) + π))))
213	168, 196, 212	3brtr4d 4615	1 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑦 ∈ 𝑈)) → (abs‘((𝐺‘𝑛)‘𝑦)) ≤ (𝑇‘𝑛))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∀wral 2896 {crab 2900 ∖ cdif 3537 ⊆ wss 3540 ifcif 4036 class class class wbr 4583 ↦ cmpt 4643 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 · cmul 9820 ≤ cle 9954 − cmin 10145 -cneg 10146 / cdiv 10563 ℕcn 10897 2c2 10947 ℕ₀cn0 11169 ℤcz 11254 ℝ⁺crp 11708 ↑cexp 12722 abscabs 13822 πcpi 14636 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: lgamgulmlem6 24560

W3C validator