cvgratnnlemfm - Intuitionistic Logic Explorer

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

Theorem cvgratnnlemfm 12296

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

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

**Assertion**
Ref	Expression
cvgratnnlemfm	⊢ (𝜑 → (abs‘(𝐹‘𝑀)) < ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) / 𝑀))

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

**Proof of Theorem cvgratnnlemfm**
Step	Hyp	Ref	Expression
1		fveq2 5695	. . . . 5 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀))
2	1	eleq1d 2307	. . . 4 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑀) ∈ ℂ))
3		cvgratnn.6	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℂ)
4	3	ralrimiva 2623	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝐹‘𝑘) ∈ ℂ)
5		cvgratnnlemfm.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
6	2, 4, 5	rspcdva 2934	. . 3 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ℂ)
7	6	abscld 11947	. 2 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ∈ ℝ)
8		cvgratnn.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
9		cvgratnn.gt0	. . . . . . . . . . 11 ⊢ (𝜑 → 0 < 𝐴)
10	8, 9	gt0ap0d 8957	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 # 0)
11	8, 10	rerecclapd 9164	. . . . . . . . 9 ⊢ (𝜑 → (1 / 𝐴) ∈ ℝ)
12		1red 8341	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℝ)
13	11, 12	resubcld 8708	. . . . . . . 8 ⊢ (𝜑 → ((1 / 𝐴) − 1) ∈ ℝ)
14		cvgratnn.4	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 < 1)
15	8, 9	elrpd 10094	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ⁺)
16	15	reclt1d 10111	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 < 1 ↔ 1 < (1 / 𝐴)))
17	14, 16	mpbid 147	. . . . . . . . 9 ⊢ (𝜑 → 1 < (1 / 𝐴))
18	12, 11	posdifd 8860	. . . . . . . . 9 ⊢ (𝜑 → (1 < (1 / 𝐴) ↔ 0 < ((1 / 𝐴) − 1)))
19	17, 18	mpbid 147	. . . . . . . 8 ⊢ (𝜑 → 0 < ((1 / 𝐴) − 1))
20	13, 19	elrpd 10094	. . . . . . 7 ⊢ (𝜑 → ((1 / 𝐴) − 1) ∈ ℝ⁺)
21	20	rpreccld 10108	. . . . . 6 ⊢ (𝜑 → (1 / ((1 / 𝐴) − 1)) ∈ ℝ⁺)
22	21, 15	rpdivcld 10115	. . . . 5 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝐴) ∈ ℝ⁺)
23	22	rpred 10097	. . . 4 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝐴) ∈ ℝ)
24		fveq2 5695	. . . . . . 7 ⊢ (𝑘 = 1 → (𝐹‘𝑘) = (𝐹‘1))
25	24	eleq1d 2307	. . . . . 6 ⊢ (𝑘 = 1 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘1) ∈ ℂ))
26		1nn 9315	. . . . . . 7 ⊢ 1 ∈ ℕ
27	26	a1i 9	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℕ)
28	25, 4, 27	rspcdva 2934	. . . . 5 ⊢ (𝜑 → (𝐹‘1) ∈ ℂ)
29	28	abscld 11947	. . . 4 ⊢ (𝜑 → (abs‘(𝐹‘1)) ∈ ℝ)
30	23, 29	remulcld 8356	. . 3 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) ∈ ℝ)
31	30, 5	nndivred 9354	. 2 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀) ∈ ℝ)
32		peano2re 8462	. . . . 5 ⊢ ((abs‘(𝐹‘1)) ∈ ℝ → ((abs‘(𝐹‘1)) + 1) ∈ ℝ)
33	29, 32	syl 14	. . . 4 ⊢ (𝜑 → ((abs‘(𝐹‘1)) + 1) ∈ ℝ)
34	23, 33	remulcld 8356	. . 3 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) ∈ ℝ)
35	34, 5	nndivred 9354	. 2 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) / 𝑀) ∈ ℝ)
36		nnm1nn0 9604	. . . . . 6 ⊢ (𝑀 ∈ ℕ → (𝑀 − 1) ∈ ℕ₀)
37	5, 36	syl 14	. . . . 5 ⊢ (𝜑 → (𝑀 − 1) ∈ ℕ₀)
38	8, 37	reexpcld 11128	. . . 4 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) ∈ ℝ)
39	29, 38	remulcld 8356	. . 3 ⊢ (𝜑 → ((abs‘(𝐹‘1)) · (𝐴↑(𝑀 − 1))) ∈ ℝ)
40		cvgratnn.7	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘))))
41	8, 14, 9, 3, 40, 5	cvgratnnlemnexp 12291	. . 3 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ≤ ((abs‘(𝐹‘1)) · (𝐴↑(𝑀 − 1))))
42	23, 5	nndivred 9354	. . . . 5 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀) ∈ ℝ)
43	28	absge0d 11950	. . . . 5 ⊢ (𝜑 → 0 ≤ (abs‘(𝐹‘1)))
44	8	recnd 8354	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ)
45	5	nnzd 9767	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
46	44, 10, 45	expm1apd 11121	. . . . . . . 8 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) = ((𝐴↑𝑀) / 𝐴))
47	5	nnnn0d 9620	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
48	8, 47	reexpcld 11128	. . . . . . . . 9 ⊢ (𝜑 → (𝐴↑𝑀) ∈ ℝ)
49	21	rpred 10097	. . . . . . . . . 10 ⊢ (𝜑 → (1 / ((1 / 𝐴) − 1)) ∈ ℝ)
50	49, 5	nndivred 9354	. . . . . . . . 9 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝑀) ∈ ℝ)
51	8, 14, 9, 5	cvgratnnlembern 12290	. . . . . . . . 9 ⊢ (𝜑 → (𝐴↑𝑀) < ((1 / ((1 / 𝐴) − 1)) / 𝑀))
52	48, 50, 15, 51	ltdiv1dd 10155	. . . . . . . 8 ⊢ (𝜑 → ((𝐴↑𝑀) / 𝐴) < (((1 / ((1 / 𝐴) − 1)) / 𝑀) / 𝐴))
53	46, 52	eqbrtrd 4152	. . . . . . 7 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) < (((1 / ((1 / 𝐴) − 1)) / 𝑀) / 𝐴))
54	49	recnd 8354	. . . . . . . 8 ⊢ (𝜑 → (1 / ((1 / 𝐴) − 1)) ∈ ℂ)
55	5	nncnd 9318	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℂ)
56	5	nnap0d 9350	. . . . . . . 8 ⊢ (𝜑 → 𝑀 # 0)
57	54, 55, 44, 56, 10	divdiv32apd 9146	. . . . . . 7 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝑀) / 𝐴) = (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀))
58	53, 57	breqtrd 4156	. . . . . 6 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) < (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀))
59	38, 42, 58	ltled 8445	. . . . 5 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) ≤ (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀))
60	38, 42, 29, 43, 59	lemul2ad 9270	. . . 4 ⊢ (𝜑 → ((abs‘(𝐹‘1)) · (𝐴↑(𝑀 − 1))) ≤ ((abs‘(𝐹‘1)) · (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀)))
61	29	recnd 8354	. . . . . . 7 ⊢ (𝜑 → (abs‘(𝐹‘1)) ∈ ℂ)
62	23	recnd 8354	. . . . . . 7 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝐴) ∈ ℂ)
63	61, 62	mulcomd 8347	. . . . . 6 ⊢ (𝜑 → ((abs‘(𝐹‘1)) · ((1 / ((1 / 𝐴) − 1)) / 𝐴)) = (((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))))
64	63	oveq1d 6100	. . . . 5 ⊢ (𝜑 → (((abs‘(𝐹‘1)) · ((1 / ((1 / 𝐴) − 1)) / 𝐴)) / 𝑀) = ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀))
65	61, 62, 55, 56	divassapd 9156	. . . . 5 ⊢ (𝜑 → (((abs‘(𝐹‘1)) · ((1 / ((1 / 𝐴) − 1)) / 𝐴)) / 𝑀) = ((abs‘(𝐹‘1)) · (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀)))
66	64, 65	eqtr3d 2273	. . . 4 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀) = ((abs‘(𝐹‘1)) · (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀)))
67	60, 66	breqtrrd 4158	. . 3 ⊢ (𝜑 → ((abs‘(𝐹‘1)) · (𝐴↑(𝑀 − 1))) ≤ ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀))
68	7, 39, 31, 41, 67	letrd 8450	. 2 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ≤ ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀))
69	5	nnrpd 10095	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ⁺)
70	29	ltp1d 9260	. . . 4 ⊢ (𝜑 → (abs‘(𝐹‘1)) < ((abs‘(𝐹‘1)) + 1))
71	29, 33, 22, 70	ltmul2dd 10154	. . 3 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) < (((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)))
72	30, 34, 69, 71	ltdiv1dd 10155	. 2 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀) < ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) / 𝑀))
73	7, 31, 35, 68, 72	lelttrd 8451	1 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) < ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) / 𝑀))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 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 / cdiv 9002 ℕcn 9304 ℕ₀cn0 9563 ↑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: cvgratnnlemrate 12297

W3C validator