abelthlem8 - Metamath Proof Explorer

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

Theorem abelthlem8 26325

Description: Lemma for abelth 26327. (Contributed by Mario Carneiro, 2-Apr-2015.)

**Hypotheses**
Ref	Expression
abelth.1	⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
abelth.2	⊢ (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )
abelth.3	⊢ (𝜑 → 𝑀 ∈ ℝ)
abelth.4	⊢ (𝜑 → 0 ≤ 𝑀)
abelth.5	⊢ 𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}
abelth.6	⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ Σ𝑛 ∈ ℕ₀ ((𝐴‘𝑛) · (𝑥↑𝑛)))
abelth.7	⊢ (𝜑 → seq0( + , 𝐴) ⇝ 0)

**Assertion**
Ref	Expression
abelthlem8	⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → ∃𝑤 ∈ ℝ⁺ ∀𝑦 ∈ 𝑆 ((abs‘(1 − 𝑦)) < 𝑤 → (abs‘((𝐹‘1) − (𝐹‘𝑦))) < 𝑅))

Distinct variable groups: 𝑤,𝑛,𝑥,𝑦,𝑧,𝑀 𝑅,𝑛,𝑤,𝑥,𝑦,𝑧 𝐴,𝑛,𝑤,𝑥,𝑦,𝑧 𝜑,𝑛,𝑤,𝑥,𝑦 𝑤,𝐹,𝑦 𝑆,𝑛,𝑤,𝑥,𝑦 Allowed substitution hints: 𝜑(𝑧) 𝑆(𝑧) 𝐹(𝑥,𝑧,𝑛)

Proof of Theorem abelthlem8 Dummy variables 𝑖 𝑗 𝑘 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nn0uz 12811	. . 3 ⊢ ℕ₀ = (ℤ_≥‘0)
2		0zd 12517	. . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → 0 ∈ ℤ)
3		id 22	. . . 4 ⊢ (𝑅 ∈ ℝ⁺ → 𝑅 ∈ ℝ⁺)
4		abelth.3	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℝ)
5		abelth.4	. . . . 5 ⊢ (𝜑 → 0 ≤ 𝑀)
6	4, 5	ge0p1rpd 13001	. . . 4 ⊢ (𝜑 → (𝑀 + 1) ∈ ℝ⁺)
7		rpdivcl 12954	. . . 4 ⊢ ((𝑅 ∈ ℝ⁺ ∧ (𝑀 + 1) ∈ ℝ⁺) → (𝑅 / (𝑀 + 1)) ∈ ℝ⁺)
8	3, 6, 7	syl2anr 597	. . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → (𝑅 / (𝑀 + 1)) ∈ ℝ⁺)
9		eqidd 2730	. . 3 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑘 ∈ ℕ₀) → (seq0( + , 𝐴)‘𝑘) = (seq0( + , 𝐴)‘𝑘))
10		abelth.7	. . . 4 ⊢ (𝜑 → seq0( + , 𝐴) ⇝ 0)
11	10	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → seq0( + , 𝐴) ⇝ 0)
12	1, 2, 8, 9, 11	climi0 15454	. 2 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → ∃𝑗 ∈ ℕ₀ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))
13	8	adantr 480	. . . 4 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) → (𝑅 / (𝑀 + 1)) ∈ ℝ⁺)
14		fzfid 13914	. . . . . . 7 ⊢ (𝜑 → (0...(𝑗 − 1)) ∈ Fin)
15		0zd 12517	. . . . . . . . . 10 ⊢ (𝜑 → 0 ∈ ℤ)
16		abelth.1	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
17	16	ffvelcdmda 7038	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑤 ∈ ℕ₀) → (𝐴‘𝑤) ∈ ℂ)
18	1, 15, 17	serf 13971	. . . . . . . . 9 ⊢ (𝜑 → seq0( + , 𝐴):ℕ₀⟶ℂ)
19		elfznn0 13557	. . . . . . . . 9 ⊢ (𝑖 ∈ (0...(𝑗 − 1)) → 𝑖 ∈ ℕ₀)
20		ffvelcdm 7035	. . . . . . . . 9 ⊢ ((seq0( + , 𝐴):ℕ₀⟶ℂ ∧ 𝑖 ∈ ℕ₀) → (seq0( + , 𝐴)‘𝑖) ∈ ℂ)
21	18, 19, 20	syl2an 596	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...(𝑗 − 1))) → (seq0( + , 𝐴)‘𝑖) ∈ ℂ)
22	21	abscld 15381	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...(𝑗 − 1))) → (abs‘(seq0( + , 𝐴)‘𝑖)) ∈ ℝ)
23	14, 22	fsumrecl 15676	. . . . . 6 ⊢ (𝜑 → Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) ∈ ℝ)
24	23	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) → Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) ∈ ℝ)
25	21	absge0d 15389	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0...(𝑗 − 1))) → 0 ≤ (abs‘(seq0( + , 𝐴)‘𝑖)))
26	14, 22, 25	fsumge0 15737	. . . . . 6 ⊢ (𝜑 → 0 ≤ Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)))
27	26	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) → 0 ≤ Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)))
28	24, 27	ge0p1rpd 13001	. . . 4 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) → (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1) ∈ ℝ⁺)
29	13, 28	rpdivcld 12988	. . 3 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) → ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)) ∈ ℝ⁺)
30		abelth.2	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )
31		abelth.5	. . . . . . . . . . . . . . . . 17 ⊢ 𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}
32	16, 30, 4, 5, 31	abelthlem2 26318	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1 ∈ 𝑆 ∧ (𝑆 ∖ {1}) ⊆ (0(ball‘(abs ∘ − ))1)))
33	32	simpld 494	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 1 ∈ 𝑆)
34		oveq1 7376	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 1 → (𝑥↑𝑛) = (1↑𝑛))
35		nn0z 12530	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℕ₀ → 𝑛 ∈ ℤ)
36		1exp 14032	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℤ → (1↑𝑛) = 1)
37	35, 36	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ₀ → (1↑𝑛) = 1)
38	34, 37	sylan9eq 2784	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 = 1 ∧ 𝑛 ∈ ℕ₀) → (𝑥↑𝑛) = 1)
39	38	oveq2d 7385	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 = 1 ∧ 𝑛 ∈ ℕ₀) → ((𝐴‘𝑛) · (𝑥↑𝑛)) = ((𝐴‘𝑛) · 1))
40	39	sumeq2dv 15644	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 1 → Σ𝑛 ∈ ℕ₀ ((𝐴‘𝑛) · (𝑥↑𝑛)) = Σ𝑛 ∈ ℕ₀ ((𝐴‘𝑛) · 1))
41		abelth.6	. . . . . . . . . . . . . . . 16 ⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ Σ𝑛 ∈ ℕ₀ ((𝐴‘𝑛) · (𝑥↑𝑛)))
42		sumex 15630	. . . . . . . . . . . . . . . 16 ⊢ Σ𝑛 ∈ ℕ₀ ((𝐴‘𝑛) · 1) ∈ V
43	40, 41, 42	fvmpt 6950	. . . . . . . . . . . . . . 15 ⊢ (1 ∈ 𝑆 → (𝐹‘1) = Σ𝑛 ∈ ℕ₀ ((𝐴‘𝑛) · 1))
44	33, 43	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐹‘1) = Σ𝑛 ∈ ℕ₀ ((𝐴‘𝑛) · 1))
45	16	ffvelcdmda 7038	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (𝐴‘𝑛) ∈ ℂ)
46	45	mulridd 11167	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → ((𝐴‘𝑛) · 1) = (𝐴‘𝑛))
47	46	eqcomd 2735	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (𝐴‘𝑛) = ((𝐴‘𝑛) · 1))
48	46, 45	eqeltrd 2828	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → ((𝐴‘𝑛) · 1) ∈ ℂ)
49	1, 15, 47, 48, 10	isumclim 15699	. . . . . . . . . . . . . 14 ⊢ (𝜑 → Σ𝑛 ∈ ℕ₀ ((𝐴‘𝑛) · 1) = 0)
50	44, 49	eqtrd 2764	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐹‘1) = 0)
51	50	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (𝐹‘1) = 0)
52	51	oveq1d 7384	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → ((𝐹‘1) − (𝐹‘𝑦)) = (0 − (𝐹‘𝑦)))
53		df-neg 11384	. . . . . . . . . . 11 ⊢ -(𝐹‘𝑦) = (0 − (𝐹‘𝑦))
54	52, 53	eqtr4di 2782	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → ((𝐹‘1) − (𝐹‘𝑦)) = -(𝐹‘𝑦))
55	54	fveq2d 6844	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (abs‘((𝐹‘1) − (𝐹‘𝑦))) = (abs‘-(𝐹‘𝑦)))
56	16, 30, 4, 5, 31, 41	abelthlem4 26320	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝑆⟶ℂ)
57	56	ffvelcdmda 7038	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (𝐹‘𝑦) ∈ ℂ)
58	57	absnegd 15394	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (abs‘-(𝐹‘𝑦)) = (abs‘(𝐹‘𝑦)))
59	55, 58	eqtrd 2764	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (abs‘((𝐹‘1) − (𝐹‘𝑦))) = (abs‘(𝐹‘𝑦)))
60	59	adantlr 715	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑦 ∈ 𝑆) → (abs‘((𝐹‘1) − (𝐹‘𝑦))) = (abs‘(𝐹‘𝑦)))
61	60	ad2ant2r 747	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) → (abs‘((𝐹‘1) − (𝐹‘𝑦))) = (abs‘(𝐹‘𝑦)))
62		fveq2 6840	. . . . . . . . . . 11 ⊢ (𝑦 = 1 → (𝐹‘𝑦) = (𝐹‘1))
63	62, 50	sylan9eqr 2786	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 = 1) → (𝐹‘𝑦) = 0)
64	63	abs00bd 15233	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = 1) → (abs‘(𝐹‘𝑦)) = 0)
65	64	ad5ant15 758	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) ∧ 𝑦 = 1) → (abs‘(𝐹‘𝑦)) = 0)
66		simpllr 775	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) → 𝑅 ∈ ℝ⁺)
67	66	rpgt0d 12974	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) → 0 < 𝑅)
68	67	adantr 480	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) ∧ 𝑦 = 1) → 0 < 𝑅)
69	65, 68	eqbrtrd 5124	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) ∧ 𝑦 = 1) → (abs‘(𝐹‘𝑦)) < 𝑅)
70	16	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → 𝐴:ℕ₀⟶ℂ)
71	30	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → seq0( + , 𝐴) ∈ dom ⇝ )
72	4	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → 𝑀 ∈ ℝ)
73	5	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → 0 ≤ 𝑀)
74	10	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → seq0( + , 𝐴) ⇝ 0)
75		simprll 778	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → 𝑦 ∈ 𝑆)
76		simprr 772	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → 𝑦 ≠ 1)
77		eldifsn 4746	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝑆 ∖ {1}) ↔ (𝑦 ∈ 𝑆 ∧ 𝑦 ≠ 1))
78	75, 76, 77	sylanbrc 583	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → 𝑦 ∈ (𝑆 ∖ {1}))
79	8	ad2antrr 726	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → (𝑅 / (𝑀 + 1)) ∈ ℝ⁺)
80		simplrl 776	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → 𝑗 ∈ ℕ₀)
81		simplrr 777	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))
82		2fveq3 6845	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑚 → (abs‘(seq0( + , 𝐴)‘𝑘)) = (abs‘(seq0( + , 𝐴)‘𝑚)))
83	82	breq1d 5112	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑚 → ((abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)) ↔ (abs‘(seq0( + , 𝐴)‘𝑚)) < (𝑅 / (𝑀 + 1))))
84	83	cbvralvw 3213	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑚)) < (𝑅 / (𝑀 + 1)))
85	81, 84	sylib 218	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → ∀𝑚 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑚)) < (𝑅 / (𝑀 + 1)))
86		simprlr 779	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))
87		2fveq3 6845	. . . . . . . . . . . . . 14 ⊢ (𝑖 = 𝑛 → (abs‘(seq0( + , 𝐴)‘𝑖)) = (abs‘(seq0( + , 𝐴)‘𝑛)))
88	87	cbvsumv 15638	. . . . . . . . . . . . 13 ⊢ Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) = Σ𝑛 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑛))
89	88	oveq1i 7379	. . . . . . . . . . . 12 ⊢ (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1) = (Σ𝑛 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑛)) + 1)
90	89	oveq2i 7380	. . . . . . . . . . 11 ⊢ ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)) = ((𝑅 / (𝑀 + 1)) / (Σ𝑛 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑛)) + 1))
91	86, 90	breqtrdi 5143	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑛 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑛)) + 1)))
92	70, 71, 72, 73, 31, 41, 74, 78, 79, 80, 85, 91	abelthlem7 26324	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → (abs‘(𝐹‘𝑦)) < ((𝑀 + 1) · (𝑅 / (𝑀 + 1))))
93		rpcn 12938	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ ℝ⁺ → 𝑅 ∈ ℂ)
94	93	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → 𝑅 ∈ ℂ)
95	6	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → (𝑀 + 1) ∈ ℝ⁺)
96	95	rpcnd 12973	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → (𝑀 + 1) ∈ ℂ)
97	95	rpne0d 12976	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → (𝑀 + 1) ≠ 0)
98	94, 96, 97	divcan2d 11936	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → ((𝑀 + 1) · (𝑅 / (𝑀 + 1))) = 𝑅)
99	98	ad2antrr 726	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → ((𝑀 + 1) · (𝑅 / (𝑀 + 1))) = 𝑅)
100	92, 99	breqtrd 5128	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ ((𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))) ∧ 𝑦 ≠ 1)) → (abs‘(𝐹‘𝑦)) < 𝑅)
101	100	anassrs 467	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) ∧ 𝑦 ≠ 1) → (abs‘(𝐹‘𝑦)) < 𝑅)
102	69, 101	pm2.61dane 3012	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) → (abs‘(𝐹‘𝑦)) < 𝑅)
103	61, 102	eqbrtrd 5124	. . . . 5 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ (𝑦 ∈ 𝑆 ∧ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)))) → (abs‘((𝐹‘1) − (𝐹‘𝑦))) < 𝑅)
104	103	expr 456	. . . 4 ⊢ ((((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) ∧ 𝑦 ∈ 𝑆) → ((abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)) → (abs‘((𝐹‘1) − (𝐹‘𝑦))) < 𝑅))
105	104	ralrimiva 3125	. . 3 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) → ∀𝑦 ∈ 𝑆 ((abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)) → (abs‘((𝐹‘1) − (𝐹‘𝑦))) < 𝑅))
106		breq2 5106	. . . 4 ⊢ (𝑤 = ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)) → ((abs‘(1 − 𝑦)) < 𝑤 ↔ (abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1))))
107	106	rspceaimv 3591	. . 3 ⊢ ((((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)) ∈ ℝ⁺ ∧ ∀𝑦 ∈ 𝑆 ((abs‘(1 − 𝑦)) < ((𝑅 / (𝑀 + 1)) / (Σ𝑖 ∈ (0...(𝑗 − 1))(abs‘(seq0( + , 𝐴)‘𝑖)) + 1)) → (abs‘((𝐹‘1) − (𝐹‘𝑦))) < 𝑅)) → ∃𝑤 ∈ ℝ⁺ ∀𝑦 ∈ 𝑆 ((abs‘(1 − 𝑦)) < 𝑤 → (abs‘((𝐹‘1) − (𝐹‘𝑦))) < 𝑅))
108	29, 105, 107	syl2anc 584	. 2 ⊢ (((𝜑 ∧ 𝑅 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ₀ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘(seq0( + , 𝐴)‘𝑘)) < (𝑅 / (𝑀 + 1)))) → ∃𝑤 ∈ ℝ⁺ ∀𝑦 ∈ 𝑆 ((abs‘(1 − 𝑦)) < 𝑤 → (abs‘((𝐹‘1) − (𝐹‘𝑦))) < 𝑅))
109	12, 108	rexlimddv 3140	1 ⊢ ((𝜑 ∧ 𝑅 ∈ ℝ⁺) → ∃𝑤 ∈ ℝ⁺ ∀𝑦 ∈ 𝑆 ((abs‘(1 − 𝑦)) < 𝑤 → (abs‘((𝐹‘1) − (𝐹‘𝑦))) < 𝑅))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ∃wrex 3053 {crab 3402 ∖ cdif 3908 ⊆ wss 3911 {csn 4585 class class class wbr 5102 ↦ cmpt 5183 dom cdm 5631 ∘ ccom 5635 ⟶wf 6495 ‘cfv 6499 (class class class)co 7369 ℂcc 11042 ℝcr 11043 0cc0 11044 1c1 11045 + caddc 11047 · cmul 11049 < clt 11184 ≤ cle 11185 − cmin 11381 -cneg 11382 / cdiv 11811 ℕ₀cn0 12418 ℤcz 12505 ℤ_≥cuz 12769 ℝ⁺crp 12927 ...cfz 13444 seqcseq 13942 ↑cexp 14002 abscabs 15176 ⇝ cli 15426 Σcsu 15628 ballcbl 21227

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-inf2 9570 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-er 8648 df-map 8778 df-pm 8779 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9369 df-inf 9370 df-oi 9439 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-n0 12419 df-z 12506 df-uz 12770 df-rp 12928 df-xadd 13049 df-ico 13288 df-icc 13289 df-fz 13445 df-fzo 13592 df-fl 13730 df-seq 13943 df-exp 14003 df-hash 14272 df-shft 15009 df-cj 15041 df-re 15042 df-im 15043 df-sqrt 15177 df-abs 15178 df-limsup 15413 df-clim 15430 df-rlim 15431 df-sum 15629 df-psmet 21232 df-xmet 21233 df-met 21234 df-bl 21235

This theorem is referenced by: abelthlem9 26326

W3C validator