cvgratnnlemmn - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > cvgratnnlemmn		GIF version

Theorem cvgratnnlemmn 12292

Description: Lemma for cvgratnn 12298. (Contributed by Jim Kingdon, 15-Nov-2022.)

**Hypotheses**
Ref	Expression
cvgratnn.3	⊢ (𝜑 → 𝐴 ∈ ℝ)
cvgratnn.4	⊢ (𝜑 → 𝐴 < 1)
cvgratnn.gt0	⊢ (𝜑 → 0 < 𝐴)
cvgratnn.6	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℂ)
cvgratnn.7	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘))))
cvgratnn.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
cvgratnn.n	⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))

**Assertion**
Ref	Expression
cvgratnnlemmn	⊢ (𝜑 → (abs‘(𝐹‘𝑁)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑁 − 𝑀))))

Distinct variable groups: 𝐴,𝑘 𝑘,𝐹 𝑘,𝑁 𝜑,𝑘 𝑘,𝑀

Proof of Theorem cvgratnnlemmn Dummy variables 𝑛 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cvgratnn.n	. 2 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
2		2fveq3 5700	. . . . 5 ⊢ (𝑤 = 𝑀 → (abs‘(𝐹‘𝑤)) = (abs‘(𝐹‘𝑀)))
3		oveq1 6092	. . . . . . 7 ⊢ (𝑤 = 𝑀 → (𝑤 − 𝑀) = (𝑀 − 𝑀))
4	3	oveq2d 6101	. . . . . 6 ⊢ (𝑤 = 𝑀 → (𝐴↑(𝑤 − 𝑀)) = (𝐴↑(𝑀 − 𝑀)))
5	4	oveq2d 6101	. . . . 5 ⊢ (𝑤 = 𝑀 → ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀))) = ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑀 − 𝑀))))
6	2, 5	breq12d 4143	. . . 4 ⊢ (𝑤 = 𝑀 → ((abs‘(𝐹‘𝑤)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀))) ↔ (abs‘(𝐹‘𝑀)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑀 − 𝑀)))))
7	6	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑀 → ((𝜑 → (abs‘(𝐹‘𝑤)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀)))) ↔ (𝜑 → (abs‘(𝐹‘𝑀)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑀 − 𝑀))))))
8		2fveq3 5700	. . . . 5 ⊢ (𝑤 = 𝑘 → (abs‘(𝐹‘𝑤)) = (abs‘(𝐹‘𝑘)))
9		oveq1 6092	. . . . . . 7 ⊢ (𝑤 = 𝑘 → (𝑤 − 𝑀) = (𝑘 − 𝑀))
10	9	oveq2d 6101	. . . . . 6 ⊢ (𝑤 = 𝑘 → (𝐴↑(𝑤 − 𝑀)) = (𝐴↑(𝑘 − 𝑀)))
11	10	oveq2d 6101	. . . . 5 ⊢ (𝑤 = 𝑘 → ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀))) = ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))))
12	8, 11	breq12d 4143	. . . 4 ⊢ (𝑤 = 𝑘 → ((abs‘(𝐹‘𝑤)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀))) ↔ (abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀)))))
13	12	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑘 → ((𝜑 → (abs‘(𝐹‘𝑤)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀)))) ↔ (𝜑 → (abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))))))
14		2fveq3 5700	. . . . 5 ⊢ (𝑤 = (𝑘 + 1) → (abs‘(𝐹‘𝑤)) = (abs‘(𝐹‘(𝑘 + 1))))
15		oveq1 6092	. . . . . . 7 ⊢ (𝑤 = (𝑘 + 1) → (𝑤 − 𝑀) = ((𝑘 + 1) − 𝑀))
16	15	oveq2d 6101	. . . . . 6 ⊢ (𝑤 = (𝑘 + 1) → (𝐴↑(𝑤 − 𝑀)) = (𝐴↑((𝑘 + 1) − 𝑀)))
17	16	oveq2d 6101	. . . . 5 ⊢ (𝑤 = (𝑘 + 1) → ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀))) = ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))))
18	14, 17	breq12d 4143	. . . 4 ⊢ (𝑤 = (𝑘 + 1) → ((abs‘(𝐹‘𝑤)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀))) ↔ (abs‘(𝐹‘(𝑘 + 1))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))))
19	18	imbi2d 230	. . 3 ⊢ (𝑤 = (𝑘 + 1) → ((𝜑 → (abs‘(𝐹‘𝑤)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀)))) ↔ (𝜑 → (abs‘(𝐹‘(𝑘 + 1))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))))))
20		2fveq3 5700	. . . . 5 ⊢ (𝑤 = 𝑁 → (abs‘(𝐹‘𝑤)) = (abs‘(𝐹‘𝑁)))
21		oveq1 6092	. . . . . . 7 ⊢ (𝑤 = 𝑁 → (𝑤 − 𝑀) = (𝑁 − 𝑀))
22	21	oveq2d 6101	. . . . . 6 ⊢ (𝑤 = 𝑁 → (𝐴↑(𝑤 − 𝑀)) = (𝐴↑(𝑁 − 𝑀)))
23	22	oveq2d 6101	. . . . 5 ⊢ (𝑤 = 𝑁 → ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀))) = ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑁 − 𝑀))))
24	20, 23	breq12d 4143	. . . 4 ⊢ (𝑤 = 𝑁 → ((abs‘(𝐹‘𝑤)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀))) ↔ (abs‘(𝐹‘𝑁)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑁 − 𝑀)))))
25	24	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑁 → ((𝜑 → (abs‘(𝐹‘𝑤)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑤 − 𝑀)))) ↔ (𝜑 → (abs‘(𝐹‘𝑁)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑁 − 𝑀))))))
26		fveq2 5695	. . . . . . . . 9 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀))
27	26	eleq1d 2307	. . . . . . . 8 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑀) ∈ ℂ))
28		cvgratnn.6	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℂ)
29	28	ralrimiva 2623	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝐹‘𝑘) ∈ ℂ)
30		cvgratnn.m	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℕ)
31	27, 29, 30	rspcdva 2934	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ℂ)
32	31	abscld 11947	. . . . . 6 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ∈ ℝ)
33	32	leidd 8842	. . . . 5 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ≤ (abs‘(𝐹‘𝑀)))
34	30	nncnd 9318	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℂ)
35	34	subidd 8625	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 − 𝑀) = 0)
36	35	oveq2d 6101	. . . . . . . 8 ⊢ (𝜑 → (𝐴↑(𝑀 − 𝑀)) = (𝐴↑0))
37		cvgratnn.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
38	37	recnd 8354	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ)
39	38	exp0d 11105	. . . . . . . 8 ⊢ (𝜑 → (𝐴↑0) = 1)
40	36, 39	eqtrd 2271	. . . . . . 7 ⊢ (𝜑 → (𝐴↑(𝑀 − 𝑀)) = 1)
41	40	oveq2d 6101	. . . . . 6 ⊢ (𝜑 → ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑀 − 𝑀))) = ((abs‘(𝐹‘𝑀)) · 1))
42	32	recnd 8354	. . . . . . 7 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ∈ ℂ)
43	42	mulridd 8343	. . . . . 6 ⊢ (𝜑 → ((abs‘(𝐹‘𝑀)) · 1) = (abs‘(𝐹‘𝑀)))
44	41, 43	eqtrd 2271	. . . . 5 ⊢ (𝜑 → ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑀 − 𝑀))) = (abs‘(𝐹‘𝑀)))
45	33, 44	breqtrrd 4158	. . . 4 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑀 − 𝑀))))
46	45	a1i 9	. . 3 ⊢ (𝑀 ∈ ℤ → (𝜑 → (abs‘(𝐹‘𝑀)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑀 − 𝑀)))))
47		eluznn 10000	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 𝑘 ∈ ℕ)
48	30, 47	sylan 283	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 𝑘 ∈ ℕ)
49	48, 28	syldan 282	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐹‘𝑘) ∈ ℂ)
50	49	abscld 11947	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (abs‘(𝐹‘𝑘)) ∈ ℝ)
51	32	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (abs‘(𝐹‘𝑀)) ∈ ℝ)
52	37	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 𝐴 ∈ ℝ)
53		uznn0sub 9954	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (ℤ_≥‘𝑀) → (𝑘 − 𝑀) ∈ ℕ₀)
54	53	adantl 277	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝑘 − 𝑀) ∈ ℕ₀)
55	52, 54	reexpcld 11128	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴↑(𝑘 − 𝑀)) ∈ ℝ)
56	51, 55	remulcld 8356	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))) ∈ ℝ)
57		0red 8327	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 0 ∈ ℝ)
58		cvgratnn.gt0	. . . . . . . . . 10 ⊢ (𝜑 → 0 < 𝐴)
59	58	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 0 < 𝐴)
60	57, 52, 59	ltled 8445	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 0 ≤ 𝐴)
61		lemul2a 9189	. . . . . . . . 9 ⊢ ((((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))) ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 0 ≤ 𝐴)) ∧ (abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀)))) → (𝐴 · (abs‘(𝐹‘𝑘))) ≤ (𝐴 · ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀)))))
62	61	ex 115	. . . . . . . 8 ⊢ (((abs‘(𝐹‘𝑘)) ∈ ℝ ∧ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))) ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 0 ≤ 𝐴)) → ((abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))) → (𝐴 · (abs‘(𝐹‘𝑘))) ≤ (𝐴 · ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))))))
63	50, 56, 52, 60, 62	syl112anc 1282	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))) → (𝐴 · (abs‘(𝐹‘𝑘))) ≤ (𝐴 · ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))))))
64	38	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 𝐴 ∈ ℂ)
65	42	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (abs‘(𝐹‘𝑀)) ∈ ℂ)
66	55	recnd 8354	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴↑(𝑘 − 𝑀)) ∈ ℂ)
67	64, 65, 66	mul12d 8478	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴 · ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀)))) = ((abs‘(𝐹‘𝑀)) · (𝐴 · (𝐴↑(𝑘 − 𝑀)))))
68	64, 54	expp1d 11112	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴↑((𝑘 − 𝑀) + 1)) = ((𝐴↑(𝑘 − 𝑀)) · 𝐴))
69	48	nncnd 9318	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 𝑘 ∈ ℂ)
70		1cnd 8342	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 1 ∈ ℂ)
71		eluzel2 9926	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
72	71	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 𝑀 ∈ ℤ)
73	72	zcnd 9769	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → 𝑀 ∈ ℂ)
74	69, 70, 73	addsubd 8658	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((𝑘 + 1) − 𝑀) = ((𝑘 − 𝑀) + 1))
75	74	oveq2d 6101	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴↑((𝑘 + 1) − 𝑀)) = (𝐴↑((𝑘 − 𝑀) + 1)))
76	64, 66	mulcomd 8347	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴 · (𝐴↑(𝑘 − 𝑀))) = ((𝐴↑(𝑘 − 𝑀)) · 𝐴))
77	68, 75, 76	3eqtr4rd 2282	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴 · (𝐴↑(𝑘 − 𝑀))) = (𝐴↑((𝑘 + 1) − 𝑀)))
78	77	oveq2d 6101	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((abs‘(𝐹‘𝑀)) · (𝐴 · (𝐴↑(𝑘 − 𝑀)))) = ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))))
79	67, 78	eqtrd 2271	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴 · ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀)))) = ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))))
80	79	breq2d 4142	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((𝐴 · (abs‘(𝐹‘𝑘))) ≤ (𝐴 · ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀)))) ↔ (𝐴 · (abs‘(𝐹‘𝑘))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))))
81	63, 80	sylibd 149	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))) → (𝐴 · (abs‘(𝐹‘𝑘))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))))
82		cvgratnn.7	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘))))
83	48, 82	syldan 282	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘))))
84		fveq2 5695	. . . . . . . . . . 11 ⊢ (𝑛 = (𝑘 + 1) → (𝐹‘𝑛) = (𝐹‘(𝑘 + 1)))
85	84	eleq1d 2307	. . . . . . . . . 10 ⊢ (𝑛 = (𝑘 + 1) → ((𝐹‘𝑛) ∈ ℂ ↔ (𝐹‘(𝑘 + 1)) ∈ ℂ))
86		fveq2 5695	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑛 → (𝐹‘𝑘) = (𝐹‘𝑛))
87	86	eleq1d 2307	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑛 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑛) ∈ ℂ))
88	87	cbvralv 2786	. . . . . . . . . . . 12 ⊢ (∀𝑘 ∈ ℕ (𝐹‘𝑘) ∈ ℂ ↔ ∀𝑛 ∈ ℕ (𝐹‘𝑛) ∈ ℂ)
89	29, 88	sylib 122	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑛 ∈ ℕ (𝐹‘𝑛) ∈ ℂ)
90	89	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ∀𝑛 ∈ ℕ (𝐹‘𝑛) ∈ ℂ)
91	48	peano2nnd 9319	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝑘 + 1) ∈ ℕ)
92	85, 90, 91	rspcdva 2934	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐹‘(𝑘 + 1)) ∈ ℂ)
93	92	abscld 11947	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (abs‘(𝐹‘(𝑘 + 1))) ∈ ℝ)
94	52, 50	remulcld 8356	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴 · (abs‘(𝐹‘𝑘))) ∈ ℝ)
95		peano2uz 9983	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (ℤ_≥‘𝑀) → (𝑘 + 1) ∈ (ℤ_≥‘𝑀))
96	95	adantl 277	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝑘 + 1) ∈ (ℤ_≥‘𝑀))
97		uznn0sub 9954	. . . . . . . . . . 11 ⊢ ((𝑘 + 1) ∈ (ℤ_≥‘𝑀) → ((𝑘 + 1) − 𝑀) ∈ ℕ₀)
98	96, 97	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((𝑘 + 1) − 𝑀) ∈ ℕ₀)
99	52, 98	reexpcld 11128	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (𝐴↑((𝑘 + 1) − 𝑀)) ∈ ℝ)
100	51, 99	remulcld 8356	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))) ∈ ℝ)
101		letr 8408	. . . . . . . 8 ⊢ (((abs‘(𝐹‘(𝑘 + 1))) ∈ ℝ ∧ (𝐴 · (abs‘(𝐹‘𝑘))) ∈ ℝ ∧ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))) ∈ ℝ) → (((abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘))) ∧ (𝐴 · (abs‘(𝐹‘𝑘))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))) → (abs‘(𝐹‘(𝑘 + 1))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))))
102	93, 94, 100, 101	syl3anc 1278	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → (((abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘))) ∧ (𝐴 · (abs‘(𝐹‘𝑘))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))) → (abs‘(𝐹‘(𝑘 + 1))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))))
103	83, 102	mpand 433	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((𝐴 · (abs‘(𝐹‘𝑘))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))) → (abs‘(𝐹‘(𝑘 + 1))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))))
104	81, 103	syld 45	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑀)) → ((abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))) → (abs‘(𝐹‘(𝑘 + 1))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀)))))
105	104	expcom 116	. . . 4 ⊢ (𝑘 ∈ (ℤ_≥‘𝑀) → (𝜑 → ((abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀))) → (abs‘(𝐹‘(𝑘 + 1))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))))))
106	105	a2d 26	. . 3 ⊢ (𝑘 ∈ (ℤ_≥‘𝑀) → ((𝜑 → (abs‘(𝐹‘𝑘)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑘 − 𝑀)))) → (𝜑 → (abs‘(𝐹‘(𝑘 + 1))) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑((𝑘 + 1) − 𝑀))))))
107	7, 13, 19, 25, 46, 106	uzind4 9988	. 2 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (𝜑 → (abs‘(𝐹‘𝑁)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑁 − 𝑀)))))
108	1, 107	mpcom 36	1 ⊢ (𝜑 → (abs‘(𝐹‘𝑁)) ≤ ((abs‘(𝐹‘𝑀)) · (𝐴↑(𝑁 − 𝑀))))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∀wral 2528 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ℂcc 8177 ℝcr 8178 0cc0 8179 1c1 8180 + caddc 8182 · cmul 8184 < clt 8360 ≤ cle 8361 − cmin 8497 ℕcn 9304 ℕ₀cn0 9563 ℤcz 9644 ℤ_≥cuz 9921 ↑cexp 10975 abscabs 11763

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 ax-arch 8298 ax-caucvg 8299

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8903 df-ap 8910 df-div 9003 df-inn 9305 df-2 9363 df-3 9364 df-4 9365 df-n0 9564 df-z 9645 df-uz 9922 df-rp 10055 df-seqfrec 10885 df-exp 10976 df-cj 11607 df-re 11608 df-im 11609 df-rsqrt 11764 df-abs 11765

This theorem is used by: cvgratnnlemabsle 12294

W3C validator