| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cvgratnn | GIF version | ||
| Description: Ratio test for convergence of a complex infinite series. If the ratio 𝐴 of the absolute values of successive terms in an infinite sequence 𝐹 is less than 1 for all terms, then the infinite sum of the terms of 𝐹 converges to a complex number. Although this theorem is similar to cvgratz 12083 and cvgratgt0 12084, the decision to index starting at one is not merely cosmetic, as proving convergence using climcvg1n 11901 is sensitive to how a sequence is indexed. (Contributed by NM, 26-Apr-2005.) (Revised by Jim Kingdon, 12-Nov-2022.) |
| Ref | Expression |
|---|---|
| cvgratnn.3 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| cvgratnn.4 | ⊢ (𝜑 → 𝐴 < 1) |
| cvgratnn.gt0 | ⊢ (𝜑 → 0 < 𝐴) |
| cvgratnn.6 | ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℂ) |
| cvgratnn.7 | ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘)))) |
| Ref | Expression |
|---|---|
| cvgratnn | ⊢ (𝜑 → seq1( + , 𝐹) ∈ dom ⇝ ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnuz 9782 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 9496 | . . 3 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 3 | cvgratnn.6 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℂ) | |
| 4 | 1, 2, 3 | serf 10735 | . 2 ⊢ (𝜑 → seq1( + , 𝐹):ℕ⟶ℂ) |
| 5 | cvgratnn.3 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 6 | cvgratnn.gt0 | . . . . . . . . . 10 ⊢ (𝜑 → 0 < 𝐴) | |
| 7 | 5, 6 | elrpd 9918 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
| 8 | 7 | rprecred 9933 | . . . . . . . 8 ⊢ (𝜑 → (1 / 𝐴) ∈ ℝ) |
| 9 | 1red 8184 | . . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 10 | 8, 9 | resubcld 8550 | . . . . . . 7 ⊢ (𝜑 → ((1 / 𝐴) − 1) ∈ ℝ) |
| 11 | cvgratnn.4 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 < 1) | |
| 12 | 7 | reclt1d 9935 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴 < 1 ↔ 1 < (1 / 𝐴))) |
| 13 | 11, 12 | mpbid 147 | . . . . . . . 8 ⊢ (𝜑 → 1 < (1 / 𝐴)) |
| 14 | 9, 8 | posdifd 8702 | . . . . . . . 8 ⊢ (𝜑 → (1 < (1 / 𝐴) ↔ 0 < ((1 / 𝐴) − 1))) |
| 15 | 13, 14 | mpbid 147 | . . . . . . 7 ⊢ (𝜑 → 0 < ((1 / 𝐴) − 1)) |
| 16 | 10, 15 | elrpd 9918 | . . . . . 6 ⊢ (𝜑 → ((1 / 𝐴) − 1) ∈ ℝ+) |
| 17 | 16 | rpreccld 9932 | . . . . 5 ⊢ (𝜑 → (1 / ((1 / 𝐴) − 1)) ∈ ℝ+) |
| 18 | 17, 7 | rpdivcld 9939 | . . . 4 ⊢ (𝜑 → ((1 / ((1 / 𝐴) − 1)) / 𝐴) ∈ ℝ+) |
| 19 | fveq2 5635 | . . . . . . . 8 ⊢ (𝑘 = 1 → (𝐹‘𝑘) = (𝐹‘1)) | |
| 20 | 19 | eleq1d 2298 | . . . . . . 7 ⊢ (𝑘 = 1 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘1) ∈ ℂ)) |
| 21 | 3 | ralrimiva 2603 | . . . . . . 7 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝐹‘𝑘) ∈ ℂ) |
| 22 | 1nn 9144 | . . . . . . . 8 ⊢ 1 ∈ ℕ | |
| 23 | 22 | a1i 9 | . . . . . . 7 ⊢ (𝜑 → 1 ∈ ℕ) |
| 24 | 20, 21, 23 | rspcdva 2913 | . . . . . 6 ⊢ (𝜑 → (𝐹‘1) ∈ ℂ) |
| 25 | 24 | abscld 11732 | . . . . 5 ⊢ (𝜑 → (abs‘(𝐹‘1)) ∈ ℝ) |
| 26 | 24 | absge0d 11735 | . . . . 5 ⊢ (𝜑 → 0 ≤ (abs‘(𝐹‘1))) |
| 27 | 25, 26 | ge0p1rpd 9952 | . . . 4 ⊢ (𝜑 → ((abs‘(𝐹‘1)) + 1) ∈ ℝ+) |
| 28 | 18, 27 | rpmulcld 9938 | . . 3 ⊢ (𝜑 → (((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) ∈ ℝ+) |
| 29 | 9, 5 | resubcld 8550 | . . . . 5 ⊢ (𝜑 → (1 − 𝐴) ∈ ℝ) |
| 30 | 5, 9 | posdifd 8702 | . . . . . 6 ⊢ (𝜑 → (𝐴 < 1 ↔ 0 < (1 − 𝐴))) |
| 31 | 11, 30 | mpbid 147 | . . . . 5 ⊢ (𝜑 → 0 < (1 − 𝐴)) |
| 32 | 29, 31 | elrpd 9918 | . . . 4 ⊢ (𝜑 → (1 − 𝐴) ∈ ℝ+) |
| 33 | 7, 32 | rpdivcld 9939 | . . 3 ⊢ (𝜑 → (𝐴 / (1 − 𝐴)) ∈ ℝ+) |
| 34 | 28, 33 | rpmulcld 9938 | . 2 ⊢ (𝜑 → ((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) · (𝐴 / (1 − 𝐴))) ∈ ℝ+) |
| 35 | 5 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ (ℤ≥‘𝑚))) → 𝐴 ∈ ℝ) |
| 36 | 11 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ (ℤ≥‘𝑚))) → 𝐴 < 1) |
| 37 | 6 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ (ℤ≥‘𝑚))) → 0 < 𝐴) |
| 38 | 3 | adantlr 477 | . . . 4 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ (ℤ≥‘𝑚))) ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℂ) |
| 39 | cvgratnn.7 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘)))) | |
| 40 | 39 | adantlr 477 | . . . 4 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ (ℤ≥‘𝑚))) ∧ 𝑘 ∈ ℕ) → (abs‘(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (abs‘(𝐹‘𝑘)))) |
| 41 | simprl 529 | . . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ (ℤ≥‘𝑚))) → 𝑚 ∈ ℕ) | |
| 42 | simprr 531 | . . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ (ℤ≥‘𝑚))) → 𝑛 ∈ (ℤ≥‘𝑚)) | |
| 43 | 35, 36, 37, 38, 40, 41, 42 | cvgratnnlemrate 12081 | . . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ (ℤ≥‘𝑚))) → (abs‘((seq1( + , 𝐹)‘𝑛) − (seq1( + , 𝐹)‘𝑚))) < (((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) · (𝐴 / (1 − 𝐴))) / 𝑚)) |
| 44 | 43 | ralrimivva 2612 | . 2 ⊢ (𝜑 → ∀𝑚 ∈ ℕ ∀𝑛 ∈ (ℤ≥‘𝑚)(abs‘((seq1( + , 𝐹)‘𝑛) − (seq1( + , 𝐹)‘𝑚))) < (((((1 / ((1 / 𝐴) − 1)) / 𝐴) · ((abs‘(𝐹‘1)) + 1)) · (𝐴 / (1 − 𝐴))) / 𝑚)) |
| 45 | 4, 34, 44 | climcvg1n 11901 | 1 ⊢ (𝜑 → seq1( + , 𝐹) ∈ dom ⇝ ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 class class class wbr 4086 dom cdm 4723 ‘cfv 5324 (class class class)co 6013 ℂcc 8020 ℝcr 8021 0cc0 8022 1c1 8023 + caddc 8025 · cmul 8027 < clt 8204 ≤ cle 8205 − cmin 8340 / cdiv 8842 ℕcn 9133 ℤ≥cuz 9745 seqcseq 10699 abscabs 11548 ⇝ cli 11829 |
| 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 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-pre-mulext 8140 ax-arch 8141 ax-caucvg 8142 |
| 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 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-isom 5333 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-irdg 6531 df-frec 6552 df-1o 6577 df-oadd 6581 df-er 6697 df-en 6905 df-dom 6906 df-fin 6907 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-ap 8752 df-div 8843 df-inn 9134 df-2 9192 df-3 9193 df-4 9194 df-n0 9393 df-z 9470 df-uz 9746 df-q 9844 df-rp 9879 df-ico 10119 df-fz 10234 df-fzo 10368 df-seqfrec 10700 df-exp 10791 df-ihash 11028 df-cj 11393 df-re 11394 df-im 11395 df-rsqrt 11549 df-abs 11550 df-clim 11830 df-sumdc 11905 |
| This theorem is referenced by: cvgratz 12083 |
| Copyright terms: Public domain | W3C validator |