cvgratnnlemfm - Intuitionistic Logic Explorer

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

Theorem cvgratnnlemfm 12035

Description: Lemma for cvgratnn 12037. (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 5626	. . . . 5 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀))
2	1	eleq1d 2298	. . . 4 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑀) ∈ ℂ))
3		cvgratnn.6	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℂ)
4	3	ralrimiva 2603	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝐹‘𝑘) ∈ ℂ)
5		cvgratnnlemfm.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
6	2, 4, 5	rspcdva 2912	. . 3 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ℂ)
7	6	abscld 11687	. 2 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ∈ ℝ)
8		cvgratnn.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
9		cvgratnn.gt0	. . . . . . . . . . 11 ⊢ (𝜑 → 0 < 𝐴)
10	8, 9	gt0ap0d 8772	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 # 0)
11	8, 10	rerecclapd 8977	. . . . . . . . 9 ⊢ (𝜑 → (1 / 𝐴) ∈ ℝ)
12		1red 8157	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℝ)
13	11, 12	resubcld 8523	. . . . . . . 8 ⊢ (𝜑 → ((1 / 𝐴) − 1) ∈ ℝ)
14		cvgratnn.4	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 < 1)
15	8, 9	elrpd 9885	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ⁺)
16	15	reclt1d 9902	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 < 1 ↔ 1 < (1 / 𝐴)))
17	14, 16	mpbid 147	. . . . . . . . 9 ⊢ (𝜑 → 1 < (1 / 𝐴))
18	12, 11	posdifd 8675	. . . . . . . . 9 ⊢ (𝜑 → (1 < (1 / 𝐴) ↔ 0 < ((1 / 𝐴) − 1)))
19	17, 18	mpbid 147	. . . . . . . 8 ⊢ (𝜑 → 0 < ((1 / 𝐴) − 1))
20	13, 19	elrpd 9885	. . . . . . 7 ⊢ (𝜑 → ((1 / 𝐴) − 1) ∈ ℝ⁺)
21	20	rpreccld 9899	. . . . . 6 ⊢ (𝜑 → (1 / ((1 / 𝐴) − 1)) ∈ ℝ⁺)
22	21, 15	rpdivcld 9906	. . . . 5 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝐴) ∈ ℝ⁺)
23	22	rpred 9888	. . . 4 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝐴) ∈ ℝ)
24		fveq2 5626	. . . . . . 7 ⊢ (𝑘 = 1 → (𝐹‘𝑘) = (𝐹‘1))
25	24	eleq1d 2298	. . . . . 6 ⊢ (𝑘 = 1 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘1) ∈ ℂ))
26		1nn 9117	. . . . . . 7 ⊢ 1 ∈ ℕ
27	26	a1i 9	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℕ)
28	25, 4, 27	rspcdva 2912	. . . . 5 ⊢ (𝜑 → (𝐹‘1) ∈ ℂ)
29	28	abscld 11687	. . . 4 ⊢ (𝜑 → (abs‘(𝐹‘1)) ∈ ℝ)
30	23, 29	remulcld 8173	. . 3 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) ∈ ℝ)
31	30, 5	nndivred 9156	. 2 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀) ∈ ℝ)
32		peano2re 8278	. . . . 5 ⊢ ((abs‘(𝐹‘1)) ∈ ℝ → ((abs‘(𝐹‘1)) + 1) ∈ ℝ)
33	29, 32	syl 14	. . . 4 ⊢ (𝜑 → ((abs‘(𝐹‘1)) + 1) ∈ ℝ)
34	23, 33	remulcld 8173	. . 3 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) ∈ ℝ)
35	34, 5	nndivred 9156	. 2 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) / 𝑀) ∈ ℝ)
36		nnm1nn0 9406	. . . . . 6 ⊢ (𝑀 ∈ ℕ → (𝑀 − 1) ∈ ℕ₀)
37	5, 36	syl 14	. . . . 5 ⊢ (𝜑 → (𝑀 − 1) ∈ ℕ₀)
38	8, 37	reexpcld 10907	. . . 4 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) ∈ ℝ)
39	29, 38	remulcld 8173	. . 3 ⊢ (𝜑 → ((abs‘(𝐹‘1)) · (𝐴↑(𝑀 − 1))) ∈ ℝ)
40		cvgratnn.7	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘))))
41	8, 14, 9, 3, 40, 5	cvgratnnlemnexp 12030	. . 3 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ≤ ((abs‘(𝐹‘1)) · (𝐴↑(𝑀 − 1))))
42	23, 5	nndivred 9156	. . . . 5 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀) ∈ ℝ)
43	28	absge0d 11690	. . . . 5 ⊢ (𝜑 → 0 ≤ (abs‘(𝐹‘1)))
44	8	recnd 8171	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ)
45	5	nnzd 9564	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
46	44, 10, 45	expm1apd 10900	. . . . . . . 8 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) = ((𝐴↑𝑀) / 𝐴))
47	5	nnnn0d 9418	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
48	8, 47	reexpcld 10907	. . . . . . . . 9 ⊢ (𝜑 → (𝐴↑𝑀) ∈ ℝ)
49	21	rpred 9888	. . . . . . . . . 10 ⊢ (𝜑 → (1 / ((1 / 𝐴) − 1)) ∈ ℝ)
50	49, 5	nndivred 9156	. . . . . . . . 9 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝑀) ∈ ℝ)
51	8, 14, 9, 5	cvgratnnlembern 12029	. . . . . . . . 9 ⊢ (𝜑 → (𝐴↑𝑀) < ((1 / ((1 / 𝐴) − 1)) / 𝑀))
52	48, 50, 15, 51	ltdiv1dd 9946	. . . . . . . 8 ⊢ (𝜑 → ((𝐴↑𝑀) / 𝐴) < (((1 / ((1 / 𝐴) − 1)) / 𝑀) / 𝐴))
53	46, 52	eqbrtrd 4104	. . . . . . 7 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) < (((1 / ((1 / 𝐴) − 1)) / 𝑀) / 𝐴))
54	49	recnd 8171	. . . . . . . 8 ⊢ (𝜑 → (1 / ((1 / 𝐴) − 1)) ∈ ℂ)
55	5	nncnd 9120	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℂ)
56	5	nnap0d 9152	. . . . . . . 8 ⊢ (𝜑 → 𝑀 # 0)
57	54, 55, 44, 56, 10	divdiv32apd 8959	. . . . . . 7 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝑀) / 𝐴) = (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀))
58	53, 57	breqtrd 4108	. . . . . 6 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) < (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀))
59	38, 42, 58	ltled 8261	. . . . 5 ⊢ (𝜑 → (𝐴↑(𝑀 − 1)) ≤ (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀))
60	38, 42, 29, 43, 59	lemul2ad 9083	. . . 4 ⊢ (𝜑 → ((abs‘(𝐹‘1)) · (𝐴↑(𝑀 − 1))) ≤ ((abs‘(𝐹‘1)) · (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀)))
61	29	recnd 8171	. . . . . . 7 ⊢ (𝜑 → (abs‘(𝐹‘1)) ∈ ℂ)
62	23	recnd 8171	. . . . . . 7 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝐴) ∈ ℂ)
63	61, 62	mulcomd 8164	. . . . . 6 ⊢ (𝜑 → ((abs‘(𝐹‘1)) · ((1 / ((1 / 𝐴) − 1)) / 𝐴)) = (((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))))
64	63	oveq1d 6015	. . . . 5 ⊢ (𝜑 → (((abs‘(𝐹‘1)) · ((1 / ((1 / 𝐴) − 1)) / 𝐴)) / 𝑀) = ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀))
65	61, 62, 55, 56	divassapd 8969	. . . . 5 ⊢ (𝜑 → (((abs‘(𝐹‘1)) · ((1 / ((1 / 𝐴) − 1)) / 𝐴)) / 𝑀) = ((abs‘(𝐹‘1)) · (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀)))
66	64, 65	eqtr3d 2264	. . . 4 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀) = ((abs‘(𝐹‘1)) · (((1 / ((1 / 𝐴) − 1)) / 𝐴) / 𝑀)))
67	60, 66	breqtrrd 4110	. . 3 ⊢ (𝜑 → ((abs‘(𝐹‘1)) · (𝐴↑(𝑀 − 1))) ≤ ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀))
68	7, 39, 31, 41, 67	letrd 8266	. 2 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) ≤ ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀))
69	5	nnrpd 9886	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ⁺)
70	29	ltp1d 9073	. . . 4 ⊢ (𝜑 → (abs‘(𝐹‘1)) < ((abs‘(𝐹‘1)) + 1))
71	29, 33, 22, 70	ltmul2dd 9945	. . 3 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) < (((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)))
72	30, 34, 69, 71	ltdiv1dd 9946	. 2 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · (abs‘(𝐹‘1))) / 𝑀) < ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) / 𝑀))
73	7, 31, 35, 68, 72	lelttrd 8267	1 ⊢ (𝜑 → (abs‘(𝐹‘𝑀)) < ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) / 𝑀))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 class class class wbr 4082 ‘cfv 5317 (class class class)co 6000 ℂcc 7993 ℝcr 7994 0cc0 7995 1c1 7996 + caddc 7998 · cmul 8000 < clt 8177 ≤ cle 8178 − cmin 8313 / cdiv 8815 ℕcn 9106 ℕ₀cn0 9365 ↑cexp 10755 abscabs 11503

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-nul 4209 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-iinf 4679 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-1re 8089 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-mulrcl 8094 ax-addcom 8095 ax-mulcom 8096 ax-addass 8097 ax-mulass 8098 ax-distr 8099 ax-i2m1 8100 ax-0lt1 8101 ax-1rid 8102 ax-0id 8103 ax-rnegex 8104 ax-precex 8105 ax-cnre 8106 ax-pre-ltirr 8107 ax-pre-ltwlin 8108 ax-pre-lttrn 8109 ax-pre-apti 8110 ax-pre-ltadd 8111 ax-pre-mulgt0 8112 ax-pre-mulext 8113 ax-arch 8114 ax-caucvg 8115

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-tr 4182 df-id 4383 df-po 4386 df-iso 4387 df-iord 4456 df-on 4458 df-ilim 4459 df-suc 4461 df-iom 4682 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 df-fo 5323 df-f1o 5324 df-fv 5325 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-1st 6284 df-2nd 6285 df-recs 6449 df-frec 6535 df-pnf 8179 df-mnf 8180 df-xr 8181 df-ltxr 8182 df-le 8183 df-sub 8315 df-neg 8316 df-reap 8718 df-ap 8725 df-div 8816 df-inn 9107 df-2 9165 df-3 9166 df-4 9167 df-n0 9366 df-z 9443 df-uz 9719 df-rp 9846 df-seqfrec 10665 df-exp 10756 df-cj 11348 df-re 11349 df-im 11350 df-rsqrt 11504 df-abs 11505

This theorem is referenced by: cvgratnnlemrate 12036

W3C validator