cvgratnnlemsumlt - Intuitionistic Logic Explorer

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

Theorem cvgratnnlemsumlt 11538

Description: Lemma for cvgratnn 11541. (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‘(𝐹‘𝑘))))
cvgratnn.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
cvgratnn.n	⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))

**Assertion**
Ref	Expression
cvgratnnlemsumlt	⊢ (𝜑 → Σ𝑖 ∈ ((𝑀 + 1)...𝑁)(𝐴↑(𝑖 − 𝑀)) < (𝐴 / (1 − 𝐴)))

Distinct variable groups: 𝐴,𝑘 𝑘,𝐹 𝑘,𝑁 𝜑,𝑘 𝐴,𝑖,𝑘 𝑖,𝑀,𝑘 𝑖,𝑁 𝜑,𝑖 Allowed substitution hint: 𝐹(𝑖)

**Proof of Theorem cvgratnnlemsumlt**
Step	Hyp	Ref	Expression
1		cvgratnn.m	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℕ)
2	1	nnzd 9376	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		1zzd 9282	. . . 4 ⊢ (𝜑 → 1 ∈ ℤ)
4		cvgratnn.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
5		eluzelz 9539	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
6	4, 5	syl 14	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ)
7	6, 2	zsubcld 9382	. . . 4 ⊢ (𝜑 → (𝑁 − 𝑀) ∈ ℤ)
8		cvgratnn.3	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ)
9	8	recnd 7988	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
10	9	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 𝑀))) → 𝐴 ∈ ℂ)
11		elfznn 10056	. . . . . . 7 ⊢ (𝑘 ∈ (1...(𝑁 − 𝑀)) → 𝑘 ∈ ℕ)
12	11	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 𝑀))) → 𝑘 ∈ ℕ)
13	12	nnnn0d 9231	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 𝑀))) → 𝑘 ∈ ℕ₀)
14	10, 13	expcld 10656	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 𝑀))) → (𝐴↑𝑘) ∈ ℂ)
15		oveq2 5885	. . . 4 ⊢ (𝑘 = (𝑖 − 𝑀) → (𝐴↑𝑘) = (𝐴↑(𝑖 − 𝑀)))
16	2, 3, 7, 14, 15	fsumshft 11454	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) = Σ𝑖 ∈ ((1 + 𝑀)...((𝑁 − 𝑀) + 𝑀))(𝐴↑(𝑖 − 𝑀)))
17		1cnd 7975	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ)
18	1	nncnd 8935	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℂ)
19	17, 18	addcomd 8110	. . . . 5 ⊢ (𝜑 → (1 + 𝑀) = (𝑀 + 1))
20	6	zcnd 9378	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℂ)
21	20, 18	npcand 8274	. . . . 5 ⊢ (𝜑 → ((𝑁 − 𝑀) + 𝑀) = 𝑁)
22	19, 21	oveq12d 5895	. . . 4 ⊢ (𝜑 → ((1 + 𝑀)...((𝑁 − 𝑀) + 𝑀)) = ((𝑀 + 1)...𝑁))
23	22	sumeq1d 11376	. . 3 ⊢ (𝜑 → Σ𝑖 ∈ ((1 + 𝑀)...((𝑁 − 𝑀) + 𝑀))(𝐴↑(𝑖 − 𝑀)) = Σ𝑖 ∈ ((𝑀 + 1)...𝑁)(𝐴↑(𝑖 − 𝑀)))
24	16, 23	eqtrd 2210	. 2 ⊢ (𝜑 → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) = Σ𝑖 ∈ ((𝑀 + 1)...𝑁)(𝐴↑(𝑖 − 𝑀)))
25		fzval3 10206	. . . . 5 ⊢ ((𝑁 − 𝑀) ∈ ℤ → (1...(𝑁 − 𝑀)) = (1..^((𝑁 − 𝑀) + 1)))
26	25	sumeq1d 11376	. . . 4 ⊢ ((𝑁 − 𝑀) ∈ ℤ → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) = Σ𝑘 ∈ (1..^((𝑁 − 𝑀) + 1))(𝐴↑𝑘))
27	7, 26	syl 14	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) = Σ𝑘 ∈ (1..^((𝑁 − 𝑀) + 1))(𝐴↑𝑘))
28		1red 7974	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ)
29		cvgratnn.4	. . . . . 6 ⊢ (𝜑 → 𝐴 < 1)
30	8, 28, 29	ltapd 8597	. . . . 5 ⊢ (𝜑 → 𝐴 # 1)
31		1nn0 9194	. . . . . 6 ⊢ 1 ∈ ℕ₀
32	31	a1i 9	. . . . 5 ⊢ (𝜑 → 1 ∈ ℕ₀)
33	7	peano2zd 9380	. . . . . 6 ⊢ (𝜑 → ((𝑁 − 𝑀) + 1) ∈ ℤ)
34		eluzle 9542	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ≤ 𝑁)
35	4, 34	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ≤ 𝑁)
36	6	zred 9377	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℝ)
37	1	nnred 8934	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℝ)
38	36, 37	subge0d 8494	. . . . . . . 8 ⊢ (𝜑 → (0 ≤ (𝑁 − 𝑀) ↔ 𝑀 ≤ 𝑁))
39	35, 38	mpbird 167	. . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑁 − 𝑀))
40	7	zred 9377	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑀) ∈ ℝ)
41	28, 40	addge02d 8493	. . . . . . 7 ⊢ (𝜑 → (0 ≤ (𝑁 − 𝑀) ↔ 1 ≤ ((𝑁 − 𝑀) + 1)))
42	39, 41	mpbid 147	. . . . . 6 ⊢ (𝜑 → 1 ≤ ((𝑁 − 𝑀) + 1))
43		eluz2 9536	. . . . . 6 ⊢ (((𝑁 − 𝑀) + 1) ∈ (ℤ_≥‘1) ↔ (1 ∈ ℤ ∧ ((𝑁 − 𝑀) + 1) ∈ ℤ ∧ 1 ≤ ((𝑁 − 𝑀) + 1)))
44	3, 33, 42, 43	syl3anbrc 1181	. . . . 5 ⊢ (𝜑 → ((𝑁 − 𝑀) + 1) ∈ (ℤ_≥‘1))
45	9, 30, 32, 44	geosergap 11516	. . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (1..^((𝑁 − 𝑀) + 1))(𝐴↑𝑘) = (((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) / (1 − 𝐴)))
46	9	exp1d 10651	. . . . . . 7 ⊢ (𝜑 → (𝐴↑1) = 𝐴)
47	46, 8	eqeltrd 2254	. . . . . 6 ⊢ (𝜑 → (𝐴↑1) ∈ ℝ)
48		cvgratnn.gt0	. . . . . . . . 9 ⊢ (𝜑 → 0 < 𝐴)
49	8, 48	elrpd 9695	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ⁺)
50	49, 33	rpexpcld 10680	. . . . . . 7 ⊢ (𝜑 → (𝐴↑((𝑁 − 𝑀) + 1)) ∈ ℝ⁺)
51	50	rpred 9698	. . . . . 6 ⊢ (𝜑 → (𝐴↑((𝑁 − 𝑀) + 1)) ∈ ℝ)
52	47, 51	resubcld 8340	. . . . 5 ⊢ (𝜑 → ((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) ∈ ℝ)
53	28, 8	resubcld 8340	. . . . . 6 ⊢ (𝜑 → (1 − 𝐴) ∈ ℝ)
54	8, 28	posdifd 8491	. . . . . . 7 ⊢ (𝜑 → (𝐴 < 1 ↔ 0 < (1 − 𝐴)))
55	29, 54	mpbid 147	. . . . . 6 ⊢ (𝜑 → 0 < (1 − 𝐴))
56	53, 55	elrpd 9695	. . . . 5 ⊢ (𝜑 → (1 − 𝐴) ∈ ℝ⁺)
57	46	oveq1d 5892	. . . . . 6 ⊢ (𝜑 → ((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) = (𝐴 − (𝐴↑((𝑁 − 𝑀) + 1))))
58	8, 50	ltsubrpd 9731	. . . . . 6 ⊢ (𝜑 → (𝐴 − (𝐴↑((𝑁 − 𝑀) + 1))) < 𝐴)
59	57, 58	eqbrtrd 4027	. . . . 5 ⊢ (𝜑 → ((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) < 𝐴)
60	52, 8, 56, 59	ltdiv1dd 9756	. . . 4 ⊢ (𝜑 → (((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) / (1 − 𝐴)) < (𝐴 / (1 − 𝐴)))
61	45, 60	eqbrtrd 4027	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (1..^((𝑁 − 𝑀) + 1))(𝐴↑𝑘) < (𝐴 / (1 − 𝐴)))
62	27, 61	eqbrtrd 4027	. 2 ⊢ (𝜑 → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) < (𝐴 / (1 − 𝐴)))
63	24, 62	eqbrtrrd 4029	1 ⊢ (𝜑 → Σ𝑖 ∈ ((𝑀 + 1)...𝑁)(𝐴↑(𝑖 − 𝑀)) < (𝐴 / (1 − 𝐴)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 class class class wbr 4005 ‘cfv 5218 (class class class)co 5877 ℂcc 7811 ℝcr 7812 0cc0 7813 1c1 7814 + caddc 7816 · cmul 7818 < clt 7994 ≤ cle 7995 − cmin 8130 / cdiv 8631 ℕcn 8921 ℕ₀cn0 9178 ℤcz 9255 ℤ_≥cuz 9530 ...cfz 10010 ..^cfzo 10144 ↑cexp 10521 abscabs 11008 Σcsu 11363

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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-mulrcl 7912 ax-addcom 7913 ax-mulcom 7914 ax-addass 7915 ax-mulass 7916 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-1rid 7920 ax-0id 7921 ax-rnegex 7922 ax-precex 7923 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-apti 7928 ax-pre-ltadd 7929 ax-pre-mulgt0 7930 ax-pre-mulext 7931 ax-arch 7932 ax-caucvg 7933

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-if 3537 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-po 4298 df-iso 4299 df-iord 4368 df-on 4370 df-ilim 4371 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-isom 5227 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-1st 6143 df-2nd 6144 df-recs 6308 df-irdg 6373 df-frec 6394 df-1o 6419 df-oadd 6423 df-er 6537 df-en 6743 df-dom 6744 df-fin 6745 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 df-sub 8132 df-neg 8133 df-reap 8534 df-ap 8541 df-div 8632 df-inn 8922 df-2 8980 df-3 8981 df-4 8982 df-n0 9179 df-z 9256 df-uz 9531 df-q 9622 df-rp 9656 df-fz 10011 df-fzo 10145 df-seqfrec 10448 df-exp 10522 df-ihash 10758 df-cj 10853 df-re 10854 df-im 10855 df-rsqrt 11009 df-abs 11010 df-clim 11289 df-sumdc 11364

This theorem is referenced by: cvgratnnlemrate 11540

W3C validator