emcllem2 - Metamath Proof Explorer

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

Theorem emcllem2 24523

Description: Lemma for emcl 24529. 𝐹 is increasing, and 𝐺 is decreasing. (Contributed by Mario Carneiro, 11-Jul-2014.)

**Hypotheses**
Ref	Expression
emcl.1	⊢ 𝐹 = (𝑛 ∈ ℕ ↦ (Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) − (log‘𝑛)))
emcl.2	⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) − (log‘(𝑛 + 1))))

**Assertion**
Ref	Expression
emcllem2	⊢ (𝑁 ∈ ℕ → ((𝐹‘(𝑁 + 1)) ≤ (𝐹‘𝑁) ∧ (𝐺‘𝑁) ≤ (𝐺‘(𝑁 + 1))))

Distinct variable group: 𝑚,𝑛,𝑁 Allowed substitution hints: 𝐹(𝑚,𝑛) 𝐺(𝑚,𝑛)

**Proof of Theorem emcllem2**
Step	Hyp	Ref	Expression
1		peano2nn 10909	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ)
2	1	nnrecred 10943	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (1 / (𝑁 + 1)) ∈ ℝ)
3	1	nnrpd 11746	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℝ⁺)
4	3	relogcld 24173	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (log‘(𝑁 + 1)) ∈ ℝ)
5		nnrp 11718	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ⁺)
6	5	relogcld 24173	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (log‘𝑁) ∈ ℝ)
7	4, 6	resubcld 10337	. . . . . 6 ⊢ (𝑁 ∈ ℕ → ((log‘(𝑁 + 1)) − (log‘𝑁)) ∈ ℝ)
8		fzfid 12634	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (1...𝑁) ∈ Fin)
9		elfznn 12241	. . . . . . . . 9 ⊢ (𝑚 ∈ (1...𝑁) → 𝑚 ∈ ℕ)
10	9	adantl 481	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝑚 ∈ (1...𝑁)) → 𝑚 ∈ ℕ)
11	10	nnrecred 10943	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝑚 ∈ (1...𝑁)) → (1 / 𝑚) ∈ ℝ)
12	8, 11	fsumrecl 14312	. . . . . 6 ⊢ (𝑁 ∈ ℕ → Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) ∈ ℝ)
13	3	rpreccld 11758	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (1 / (𝑁 + 1)) ∈ ℝ⁺)
14	13	rpge0d 11752	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 0 ≤ (1 / (𝑁 + 1)))
15		1div1e1 10596	. . . . . . . . . . . 12 ⊢ (1 / 1) = 1
16		1re 9918	. . . . . . . . . . . . . 14 ⊢ 1 ∈ ℝ
17		ltaddrp 11743	. . . . . . . . . . . . . 14 ⊢ ((1 ∈ ℝ ∧ 𝑁 ∈ ℝ⁺) → 1 < (1 + 𝑁))
18	16, 5, 17	sylancr 694	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → 1 < (1 + 𝑁))
19		ax-1cn 9873	. . . . . . . . . . . . . 14 ⊢ 1 ∈ ℂ
20		nncn 10905	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
21		addcom 10101	. . . . . . . . . . . . . 14 ⊢ ((1 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (1 + 𝑁) = (𝑁 + 1))
22	19, 20, 21	sylancr 694	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → (1 + 𝑁) = (𝑁 + 1))
23	18, 22	breqtrd 4609	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → 1 < (𝑁 + 1))
24	15, 23	syl5eqbr 4618	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (1 / 1) < (𝑁 + 1))
25	1	nnred 10912	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℝ)
26	1	nngt0d 10941	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → 0 < (𝑁 + 1))
27		0lt1 10429	. . . . . . . . . . . . 13 ⊢ 0 < 1
28		ltrec1 10789	. . . . . . . . . . . . 13 ⊢ (((1 ∈ ℝ ∧ 0 < 1) ∧ ((𝑁 + 1) ∈ ℝ ∧ 0 < (𝑁 + 1))) → ((1 / 1) < (𝑁 + 1) ↔ (1 / (𝑁 + 1)) < 1))
29	16, 27, 28	mpanl12 714	. . . . . . . . . . . 12 ⊢ (((𝑁 + 1) ∈ ℝ ∧ 0 < (𝑁 + 1)) → ((1 / 1) < (𝑁 + 1) ↔ (1 / (𝑁 + 1)) < 1))
30	25, 26, 29	syl2anc 691	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → ((1 / 1) < (𝑁 + 1) ↔ (1 / (𝑁 + 1)) < 1))
31	24, 30	mpbid 221	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (1 / (𝑁 + 1)) < 1)
32	2, 14, 31	eflegeo 14690	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (exp‘(1 / (𝑁 + 1))) ≤ (1 / (1 − (1 / (𝑁 + 1)))))
33	25	recnd 9947	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℂ)
34		nnne0 10930	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0)
35	1	nnne0d 10942	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ≠ 0)
36	20, 33, 34, 35	recdivd 10697	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (1 / (𝑁 / (𝑁 + 1))) = ((𝑁 + 1) / 𝑁))
37		1cnd 9935	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℂ)
38	33, 37, 33, 35	divsubdird 10719	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → (((𝑁 + 1) − 1) / (𝑁 + 1)) = (((𝑁 + 1) / (𝑁 + 1)) − (1 / (𝑁 + 1))))
39		pncan 10166	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁)
40	20, 19, 39	sylancl 693	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → ((𝑁 + 1) − 1) = 𝑁)
41	40	oveq1d 6564	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → (((𝑁 + 1) − 1) / (𝑁 + 1)) = (𝑁 / (𝑁 + 1)))
42	33, 35	dividd 10678	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → ((𝑁 + 1) / (𝑁 + 1)) = 1)
43	42	oveq1d 6564	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → (((𝑁 + 1) / (𝑁 + 1)) − (1 / (𝑁 + 1))) = (1 − (1 / (𝑁 + 1))))
44	38, 41, 43	3eqtr3rd 2653	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (1 − (1 / (𝑁 + 1))) = (𝑁 / (𝑁 + 1)))
45	44	oveq2d 6565	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (1 / (1 − (1 / (𝑁 + 1)))) = (1 / (𝑁 / (𝑁 + 1))))
46	3, 5	rpdivcld 11765	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → ((𝑁 + 1) / 𝑁) ∈ ℝ⁺)
47	46	reeflogd 24174	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (exp‘(log‘((𝑁 + 1) / 𝑁))) = ((𝑁 + 1) / 𝑁))
48	36, 45, 47	3eqtr4d 2654	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (1 / (1 − (1 / (𝑁 + 1)))) = (exp‘(log‘((𝑁 + 1) / 𝑁))))
49	32, 48	breqtrd 4609	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (exp‘(1 / (𝑁 + 1))) ≤ (exp‘(log‘((𝑁 + 1) / 𝑁))))
50	3, 5	relogdivd 24176	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (log‘((𝑁 + 1) / 𝑁)) = ((log‘(𝑁 + 1)) − (log‘𝑁)))
51	50, 7	eqeltrd 2688	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (log‘((𝑁 + 1) / 𝑁)) ∈ ℝ)
52		efle 14687	. . . . . . . . 9 ⊢ (((1 / (𝑁 + 1)) ∈ ℝ ∧ (log‘((𝑁 + 1) / 𝑁)) ∈ ℝ) → ((1 / (𝑁 + 1)) ≤ (log‘((𝑁 + 1) / 𝑁)) ↔ (exp‘(1 / (𝑁 + 1))) ≤ (exp‘(log‘((𝑁 + 1) / 𝑁)))))
53	2, 51, 52	syl2anc 691	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → ((1 / (𝑁 + 1)) ≤ (log‘((𝑁 + 1) / 𝑁)) ↔ (exp‘(1 / (𝑁 + 1))) ≤ (exp‘(log‘((𝑁 + 1) / 𝑁)))))
54	49, 53	mpbird 246	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (1 / (𝑁 + 1)) ≤ (log‘((𝑁 + 1) / 𝑁)))
55	54, 50	breqtrd 4609	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (1 / (𝑁 + 1)) ≤ ((log‘(𝑁 + 1)) − (log‘𝑁)))
56	2, 7, 12, 55	leadd2dd 10521	. . . . 5 ⊢ (𝑁 ∈ ℕ → (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) + (1 / (𝑁 + 1))) ≤ (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) + ((log‘(𝑁 + 1)) − (log‘𝑁))))
57		id 22	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ)
58		nnuz 11599	. . . . . . 7 ⊢ ℕ = (ℤ_≥‘1)
59	57, 58	syl6eleq 2698	. . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ (ℤ_≥‘1))
60		elfznn 12241	. . . . . . . . 9 ⊢ (𝑚 ∈ (1...(𝑁 + 1)) → 𝑚 ∈ ℕ)
61	60	adantl 481	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝑚 ∈ (1...(𝑁 + 1))) → 𝑚 ∈ ℕ)
62	61	nnrecred 10943	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝑚 ∈ (1...(𝑁 + 1))) → (1 / 𝑚) ∈ ℝ)
63	62	recnd 9947	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝑚 ∈ (1...(𝑁 + 1))) → (1 / 𝑚) ∈ ℂ)
64		oveq2 6557	. . . . . 6 ⊢ (𝑚 = (𝑁 + 1) → (1 / 𝑚) = (1 / (𝑁 + 1)))
65	59, 63, 64	fsump1 14329	. . . . 5 ⊢ (𝑁 ∈ ℕ → Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) = (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) + (1 / (𝑁 + 1))))
66	4	recnd 9947	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (log‘(𝑁 + 1)) ∈ ℂ)
67	12	recnd 9947	. . . . . 6 ⊢ (𝑁 ∈ ℕ → Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) ∈ ℂ)
68	6	recnd 9947	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (log‘𝑁) ∈ ℂ)
69	66, 67, 68	addsub12d 10294	. . . . 5 ⊢ (𝑁 ∈ ℕ → ((log‘(𝑁 + 1)) + (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁))) = (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) + ((log‘(𝑁 + 1)) − (log‘𝑁))))
70	56, 65, 69	3brtr4d 4615	. . . 4 ⊢ (𝑁 ∈ ℕ → Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) ≤ ((log‘(𝑁 + 1)) + (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁))))
71		fzfid 12634	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (1...(𝑁 + 1)) ∈ Fin)
72	71, 62	fsumrecl 14312	. . . . 5 ⊢ (𝑁 ∈ ℕ → Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) ∈ ℝ)
73	12, 6	resubcld 10337	. . . . 5 ⊢ (𝑁 ∈ ℕ → (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁)) ∈ ℝ)
74	72, 4, 73	lesubadd2d 10505	. . . 4 ⊢ (𝑁 ∈ ℕ → ((Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘(𝑁 + 1))) ≤ (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁)) ↔ Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) ≤ ((log‘(𝑁 + 1)) + (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁)))))
75	70, 74	mpbird 246	. . 3 ⊢ (𝑁 ∈ ℕ → (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘(𝑁 + 1))) ≤ (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁)))
76		oveq2 6557	. . . . . . 7 ⊢ (𝑛 = (𝑁 + 1) → (1...𝑛) = (1...(𝑁 + 1)))
77	76	sumeq1d 14279	. . . . . 6 ⊢ (𝑛 = (𝑁 + 1) → Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) = Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚))
78		fveq2 6103	. . . . . 6 ⊢ (𝑛 = (𝑁 + 1) → (log‘𝑛) = (log‘(𝑁 + 1)))
79	77, 78	oveq12d 6567	. . . . 5 ⊢ (𝑛 = (𝑁 + 1) → (Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) − (log‘𝑛)) = (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘(𝑁 + 1))))
80		emcl.1	. . . . 5 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ (Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) − (log‘𝑛)))
81		ovex 6577	. . . . 5 ⊢ (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘(𝑁 + 1))) ∈ V
82	79, 80, 81	fvmpt 6191	. . . 4 ⊢ ((𝑁 + 1) ∈ ℕ → (𝐹‘(𝑁 + 1)) = (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘(𝑁 + 1))))
83	1, 82	syl 17	. . 3 ⊢ (𝑁 ∈ ℕ → (𝐹‘(𝑁 + 1)) = (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘(𝑁 + 1))))
84		oveq2 6557	. . . . . 6 ⊢ (𝑛 = 𝑁 → (1...𝑛) = (1...𝑁))
85	84	sumeq1d 14279	. . . . 5 ⊢ (𝑛 = 𝑁 → Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) = Σ𝑚 ∈ (1...𝑁)(1 / 𝑚))
86		fveq2 6103	. . . . 5 ⊢ (𝑛 = 𝑁 → (log‘𝑛) = (log‘𝑁))
87	85, 86	oveq12d 6567	. . . 4 ⊢ (𝑛 = 𝑁 → (Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) − (log‘𝑛)) = (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁)))
88		ovex 6577	. . . 4 ⊢ (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁)) ∈ V
89	87, 80, 88	fvmpt 6191	. . 3 ⊢ (𝑁 ∈ ℕ → (𝐹‘𝑁) = (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘𝑁)))
90	75, 83, 89	3brtr4d 4615	. 2 ⊢ (𝑁 ∈ ℕ → (𝐹‘(𝑁 + 1)) ≤ (𝐹‘𝑁))
91		peano2nn 10909	. . . . . . . . . 10 ⊢ ((𝑁 + 1) ∈ ℕ → ((𝑁 + 1) + 1) ∈ ℕ)
92	1, 91	syl 17	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → ((𝑁 + 1) + 1) ∈ ℕ)
93	92	nnrpd 11746	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → ((𝑁 + 1) + 1) ∈ ℝ⁺)
94	93	relogcld 24173	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (log‘((𝑁 + 1) + 1)) ∈ ℝ)
95	94, 4	resubcld 10337	. . . . . 6 ⊢ (𝑁 ∈ ℕ → ((log‘((𝑁 + 1) + 1)) − (log‘(𝑁 + 1))) ∈ ℝ)
96		logdifbnd 24520	. . . . . . 7 ⊢ ((𝑁 + 1) ∈ ℝ⁺ → ((log‘((𝑁 + 1) + 1)) − (log‘(𝑁 + 1))) ≤ (1 / (𝑁 + 1)))
97	3, 96	syl 17	. . . . . 6 ⊢ (𝑁 ∈ ℕ → ((log‘((𝑁 + 1) + 1)) − (log‘(𝑁 + 1))) ≤ (1 / (𝑁 + 1)))
98	95, 2, 12, 97	leadd2dd 10521	. . . . 5 ⊢ (𝑁 ∈ ℕ → (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) + ((log‘((𝑁 + 1) + 1)) − (log‘(𝑁 + 1)))) ≤ (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) + (1 / (𝑁 + 1))))
99	94	recnd 9947	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (log‘((𝑁 + 1) + 1)) ∈ ℂ)
100	67, 66, 99	subadd23d 10293	. . . . 5 ⊢ (𝑁 ∈ ℕ → ((Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) + (log‘((𝑁 + 1) + 1))) = (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) + ((log‘((𝑁 + 1) + 1)) − (log‘(𝑁 + 1)))))
101	98, 100, 65	3brtr4d 4615	. . . 4 ⊢ (𝑁 ∈ ℕ → ((Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) + (log‘((𝑁 + 1) + 1))) ≤ Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚))
102	12, 4	resubcld 10337	. . . . 5 ⊢ (𝑁 ∈ ℕ → (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) ∈ ℝ)
103		leaddsub 10383	. . . . 5 ⊢ (((Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) ∈ ℝ ∧ (log‘((𝑁 + 1) + 1)) ∈ ℝ ∧ Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) ∈ ℝ) → (((Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) + (log‘((𝑁 + 1) + 1))) ≤ Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) ↔ (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) ≤ (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘((𝑁 + 1) + 1)))))
104	102, 94, 72, 103	syl3anc 1318	. . . 4 ⊢ (𝑁 ∈ ℕ → (((Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) + (log‘((𝑁 + 1) + 1))) ≤ Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) ↔ (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) ≤ (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘((𝑁 + 1) + 1)))))
105	101, 104	mpbid 221	. . 3 ⊢ (𝑁 ∈ ℕ → (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) ≤ (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘((𝑁 + 1) + 1))))
106		oveq1 6556	. . . . . 6 ⊢ (𝑛 = 𝑁 → (𝑛 + 1) = (𝑁 + 1))
107	106	fveq2d 6107	. . . . 5 ⊢ (𝑛 = 𝑁 → (log‘(𝑛 + 1)) = (log‘(𝑁 + 1)))
108	85, 107	oveq12d 6567	. . . 4 ⊢ (𝑛 = 𝑁 → (Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) − (log‘(𝑛 + 1))) = (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))))
109		emcl.2	. . . 4 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) − (log‘(𝑛 + 1))))
110		ovex 6577	. . . 4 ⊢ (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))) ∈ V
111	108, 109, 110	fvmpt 6191	. . 3 ⊢ (𝑁 ∈ ℕ → (𝐺‘𝑁) = (Σ𝑚 ∈ (1...𝑁)(1 / 𝑚) − (log‘(𝑁 + 1))))
112		oveq1 6556	. . . . . . 7 ⊢ (𝑛 = (𝑁 + 1) → (𝑛 + 1) = ((𝑁 + 1) + 1))
113	112	fveq2d 6107	. . . . . 6 ⊢ (𝑛 = (𝑁 + 1) → (log‘(𝑛 + 1)) = (log‘((𝑁 + 1) + 1)))
114	77, 113	oveq12d 6567	. . . . 5 ⊢ (𝑛 = (𝑁 + 1) → (Σ𝑚 ∈ (1...𝑛)(1 / 𝑚) − (log‘(𝑛 + 1))) = (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘((𝑁 + 1) + 1))))
115		ovex 6577	. . . . 5 ⊢ (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘((𝑁 + 1) + 1))) ∈ V
116	114, 109, 115	fvmpt 6191	. . . 4 ⊢ ((𝑁 + 1) ∈ ℕ → (𝐺‘(𝑁 + 1)) = (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘((𝑁 + 1) + 1))))
117	1, 116	syl 17	. . 3 ⊢ (𝑁 ∈ ℕ → (𝐺‘(𝑁 + 1)) = (Σ𝑚 ∈ (1...(𝑁 + 1))(1 / 𝑚) − (log‘((𝑁 + 1) + 1))))
118	105, 111, 117	3brtr4d 4615	. 2 ⊢ (𝑁 ∈ ℕ → (𝐺‘𝑁) ≤ (𝐺‘(𝑁 + 1)))
119	90, 118	jca 553	1 ⊢ (𝑁 ∈ ℕ → ((𝐹‘(𝑁 + 1)) ≤ (𝐹‘𝑁) ∧ (𝐺‘𝑁) ≤ (𝐺‘(𝑁 + 1))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 class class class wbr 4583 ↦ cmpt 4643 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 < clt 9953 ≤ cle 9954 − cmin 10145 / cdiv 10563 ℕcn 10897 ℤ_≥cuz 11563 ℝ⁺crp 11708 ...cfz 12197 Σcsu 14264 expce 14631 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-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-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: emcllem6 24527 emcllem7 24528

W3C validator