cvgratnnlemsumlt - Intuitionistic Logic Explorer

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

Theorem cvgratnnlemsumlt 11535

Description: Lemma for cvgratnn 11538. (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 9373	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		1zzd 9279	. . . 4 ⊢ (𝜑 → 1 ∈ ℤ)
4		cvgratnn.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
5		eluzelz 9536	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
6	4, 5	syl 14	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ)
7	6, 2	zsubcld 9379	. . . 4 ⊢ (𝜑 → (𝑁 − 𝑀) ∈ ℤ)
8		cvgratnn.3	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ)
9	8	recnd 7985	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
10	9	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 𝑀))) → 𝐴 ∈ ℂ)
11		elfznn 10053	. . . . . . 7 ⊢ (𝑘 ∈ (1...(𝑁 − 𝑀)) → 𝑘 ∈ ℕ)
12	11	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 𝑀))) → 𝑘 ∈ ℕ)
13	12	nnnn0d 9228	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 𝑀))) → 𝑘 ∈ ℕ₀)
14	10, 13	expcld 10653	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 𝑀))) → (𝐴↑𝑘) ∈ ℂ)
15		oveq2 5882	. . . 4 ⊢ (𝑘 = (𝑖 − 𝑀) → (𝐴↑𝑘) = (𝐴↑(𝑖 − 𝑀)))
16	2, 3, 7, 14, 15	fsumshft 11451	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) = Σ𝑖 ∈ ((1 + 𝑀)...((𝑁 − 𝑀) + 𝑀))(𝐴↑(𝑖 − 𝑀)))
17		1cnd 7972	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ)
18	1	nncnd 8932	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℂ)
19	17, 18	addcomd 8107	. . . . 5 ⊢ (𝜑 → (1 + 𝑀) = (𝑀 + 1))
20	6	zcnd 9375	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℂ)
21	20, 18	npcand 8271	. . . . 5 ⊢ (𝜑 → ((𝑁 − 𝑀) + 𝑀) = 𝑁)
22	19, 21	oveq12d 5892	. . . 4 ⊢ (𝜑 → ((1 + 𝑀)...((𝑁 − 𝑀) + 𝑀)) = ((𝑀 + 1)...𝑁))
23	22	sumeq1d 11373	. . 3 ⊢ (𝜑 → Σ𝑖 ∈ ((1 + 𝑀)...((𝑁 − 𝑀) + 𝑀))(𝐴↑(𝑖 − 𝑀)) = Σ𝑖 ∈ ((𝑀 + 1)...𝑁)(𝐴↑(𝑖 − 𝑀)))
24	16, 23	eqtrd 2210	. 2 ⊢ (𝜑 → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) = Σ𝑖 ∈ ((𝑀 + 1)...𝑁)(𝐴↑(𝑖 − 𝑀)))
25		fzval3 10203	. . . . 5 ⊢ ((𝑁 − 𝑀) ∈ ℤ → (1...(𝑁 − 𝑀)) = (1..^((𝑁 − 𝑀) + 1)))
26	25	sumeq1d 11373	. . . 4 ⊢ ((𝑁 − 𝑀) ∈ ℤ → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) = Σ𝑘 ∈ (1..^((𝑁 − 𝑀) + 1))(𝐴↑𝑘))
27	7, 26	syl 14	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) = Σ𝑘 ∈ (1..^((𝑁 − 𝑀) + 1))(𝐴↑𝑘))
28		1red 7971	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ)
29		cvgratnn.4	. . . . . 6 ⊢ (𝜑 → 𝐴 < 1)
30	8, 28, 29	ltapd 8594	. . . . 5 ⊢ (𝜑 → 𝐴 # 1)
31		1nn0 9191	. . . . . 6 ⊢ 1 ∈ ℕ₀
32	31	a1i 9	. . . . 5 ⊢ (𝜑 → 1 ∈ ℕ₀)
33	7	peano2zd 9377	. . . . . 6 ⊢ (𝜑 → ((𝑁 − 𝑀) + 1) ∈ ℤ)
34		eluzle 9539	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ≤ 𝑁)
35	4, 34	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ≤ 𝑁)
36	6	zred 9374	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℝ)
37	1	nnred 8931	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℝ)
38	36, 37	subge0d 8491	. . . . . . . 8 ⊢ (𝜑 → (0 ≤ (𝑁 − 𝑀) ↔ 𝑀 ≤ 𝑁))
39	35, 38	mpbird 167	. . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑁 − 𝑀))
40	7	zred 9374	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 𝑀) ∈ ℝ)
41	28, 40	addge02d 8490	. . . . . . 7 ⊢ (𝜑 → (0 ≤ (𝑁 − 𝑀) ↔ 1 ≤ ((𝑁 − 𝑀) + 1)))
42	39, 41	mpbid 147	. . . . . 6 ⊢ (𝜑 → 1 ≤ ((𝑁 − 𝑀) + 1))
43		eluz2 9533	. . . . . 6 ⊢ (((𝑁 − 𝑀) + 1) ∈ (ℤ_≥‘1) ↔ (1 ∈ ℤ ∧ ((𝑁 − 𝑀) + 1) ∈ ℤ ∧ 1 ≤ ((𝑁 − 𝑀) + 1)))
44	3, 33, 42, 43	syl3anbrc 1181	. . . . 5 ⊢ (𝜑 → ((𝑁 − 𝑀) + 1) ∈ (ℤ_≥‘1))
45	9, 30, 32, 44	geosergap 11513	. . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (1..^((𝑁 − 𝑀) + 1))(𝐴↑𝑘) = (((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) / (1 − 𝐴)))
46	9	exp1d 10648	. . . . . . 7 ⊢ (𝜑 → (𝐴↑1) = 𝐴)
47	46, 8	eqeltrd 2254	. . . . . 6 ⊢ (𝜑 → (𝐴↑1) ∈ ℝ)
48		cvgratnn.gt0	. . . . . . . . 9 ⊢ (𝜑 → 0 < 𝐴)
49	8, 48	elrpd 9692	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ⁺)
50	49, 33	rpexpcld 10677	. . . . . . 7 ⊢ (𝜑 → (𝐴↑((𝑁 − 𝑀) + 1)) ∈ ℝ⁺)
51	50	rpred 9695	. . . . . 6 ⊢ (𝜑 → (𝐴↑((𝑁 − 𝑀) + 1)) ∈ ℝ)
52	47, 51	resubcld 8337	. . . . 5 ⊢ (𝜑 → ((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) ∈ ℝ)
53	28, 8	resubcld 8337	. . . . . 6 ⊢ (𝜑 → (1 − 𝐴) ∈ ℝ)
54	8, 28	posdifd 8488	. . . . . . 7 ⊢ (𝜑 → (𝐴 < 1 ↔ 0 < (1 − 𝐴)))
55	29, 54	mpbid 147	. . . . . 6 ⊢ (𝜑 → 0 < (1 − 𝐴))
56	53, 55	elrpd 9692	. . . . 5 ⊢ (𝜑 → (1 − 𝐴) ∈ ℝ⁺)
57	46	oveq1d 5889	. . . . . 6 ⊢ (𝜑 → ((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) = (𝐴 − (𝐴↑((𝑁 − 𝑀) + 1))))
58	8, 50	ltsubrpd 9728	. . . . . 6 ⊢ (𝜑 → (𝐴 − (𝐴↑((𝑁 − 𝑀) + 1))) < 𝐴)
59	57, 58	eqbrtrd 4025	. . . . 5 ⊢ (𝜑 → ((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) < 𝐴)
60	52, 8, 56, 59	ltdiv1dd 9753	. . . 4 ⊢ (𝜑 → (((𝐴↑1) − (𝐴↑((𝑁 − 𝑀) + 1))) / (1 − 𝐴)) < (𝐴 / (1 − 𝐴)))
61	45, 60	eqbrtrd 4025	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (1..^((𝑁 − 𝑀) + 1))(𝐴↑𝑘) < (𝐴 / (1 − 𝐴)))
62	27, 61	eqbrtrd 4025	. 2 ⊢ (𝜑 → Σ𝑘 ∈ (1...(𝑁 − 𝑀))(𝐴↑𝑘) < (𝐴 / (1 − 𝐴)))
63	24, 62	eqbrtrrd 4027	1 ⊢ (𝜑 → Σ𝑖 ∈ ((𝑀 + 1)...𝑁)(𝐴↑(𝑖 − 𝑀)) < (𝐴 / (1 − 𝐴)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 class class class wbr 4003 ‘cfv 5216 (class class class)co 5874 ℂcc 7808 ℝcr 7809 0cc0 7810 1c1 7811 + caddc 7813 · cmul 7815 < clt 7991 ≤ cle 7992 − cmin 8127 / cdiv 8628 ℕcn 8918 ℕ₀cn0 9175 ℤcz 9252 ℤ_≥cuz 9527 ...cfz 10007 ..^cfzo 10141 ↑cexp 10518 abscabs 11005 Σcsu 11360

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 4118 ax-sep 4121 ax-nul 4129 ax-pow 4174 ax-pr 4209 ax-un 4433 ax-setind 4536 ax-iinf 4587 ax-cnex 7901 ax-resscn 7902 ax-1cn 7903 ax-1re 7904 ax-icn 7905 ax-addcl 7906 ax-addrcl 7907 ax-mulcl 7908 ax-mulrcl 7909 ax-addcom 7910 ax-mulcom 7911 ax-addass 7912 ax-mulass 7913 ax-distr 7914 ax-i2m1 7915 ax-0lt1 7916 ax-1rid 7917 ax-0id 7918 ax-rnegex 7919 ax-precex 7920 ax-cnre 7921 ax-pre-ltirr 7922 ax-pre-ltwlin 7923 ax-pre-lttrn 7924 ax-pre-apti 7925 ax-pre-ltadd 7926 ax-pre-mulgt0 7927 ax-pre-mulext 7928 ax-arch 7929 ax-caucvg 7930

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 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4004 df-opab 4065 df-mpt 4066 df-tr 4102 df-id 4293 df-po 4296 df-iso 4297 df-iord 4366 df-on 4368 df-ilim 4369 df-suc 4371 df-iom 4590 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-rn 4637 df-res 4638 df-ima 4639 df-iota 5178 df-fun 5218 df-fn 5219 df-f 5220 df-f1 5221 df-fo 5222 df-f1o 5223 df-fv 5224 df-isom 5225 df-riota 5830 df-ov 5877 df-oprab 5878 df-mpo 5879 df-1st 6140 df-2nd 6141 df-recs 6305 df-irdg 6370 df-frec 6391 df-1o 6416 df-oadd 6420 df-er 6534 df-en 6740 df-dom 6741 df-fin 6742 df-pnf 7993 df-mnf 7994 df-xr 7995 df-ltxr 7996 df-le 7997 df-sub 8129 df-neg 8130 df-reap 8531 df-ap 8538 df-div 8629 df-inn 8919 df-2 8977 df-3 8978 df-4 8979 df-n0 9176 df-z 9253 df-uz 9528 df-q 9619 df-rp 9653 df-fz 10008 df-fzo 10142 df-seqfrec 10445 df-exp 10519 df-ihash 10755 df-cj 10850 df-re 10851 df-im 10852 df-rsqrt 11006 df-abs 11007 df-clim 11286 df-sumdc 11361

This theorem is referenced by: cvgratnnlemrate 11537

W3C validator