| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > geoisum1c | Structured version Visualization version GIF version | ||
| Description: The infinite sum of 𝐴 · (𝑅↑1) + 𝐴 · (𝑅↑2)... is (𝐴 · 𝑅) / (1 − 𝑅). (Contributed by NM, 2-Nov-2007.) (Revised by Mario Carneiro, 26-Apr-2014.) |
| Ref | Expression |
|---|---|
| geoisum1c | ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → Σ𝑘 ∈ ℕ (𝐴 · (𝑅↑𝑘)) = ((𝐴 · 𝑅) / (1 − 𝑅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → 𝐴 ∈ ℂ) | |
| 2 | simp2 1155 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → 𝑅 ∈ ℂ) | |
| 3 | ax-1cn 11282 | . . . 4 ⊢ 1 ∈ ℂ | |
| 4 | subcl 11580 | . . . 4 ⊢ ((1 ∈ ℂ ∧ 𝑅 ∈ ℂ) → (1 − 𝑅) ∈ ℂ) | |
| 5 | 3, 2, 4 | sylancr 599 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (1 − 𝑅) ∈ ℂ) |
| 6 | simp3 1156 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (abs‘𝑅) < 1) | |
| 7 | 1re 11332 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 8 | 7 | ltnri 11443 | . . . . . . 7 ⊢ ¬ 1 < 1 |
| 9 | abs1 15490 | . . . . . . . . 9 ⊢ (abs‘1) = 1 | |
| 10 | fveq2 6905 | . . . . . . . . 9 ⊢ (1 = 𝑅 → (abs‘1) = (abs‘𝑅)) | |
| 11 | 9, 10 | eqtr3id 2812 | . . . . . . . 8 ⊢ (1 = 𝑅 → 1 = (abs‘𝑅)) |
| 12 | 11 | breq1d 5116 | . . . . . . 7 ⊢ (1 = 𝑅 → (1 < 1 ↔ (abs‘𝑅) < 1)) |
| 13 | 8, 12 | mtbii 329 | . . . . . 6 ⊢ (1 = 𝑅 → ¬ (abs‘𝑅) < 1) |
| 14 | 13 | necon2ai 2988 | . . . . 5 ⊢ ((abs‘𝑅) < 1 → 1 ≠ 𝑅) |
| 15 | 6, 14 | syl 18 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → 1 ≠ 𝑅) |
| 16 | subeq0 11608 | . . . . . 6 ⊢ ((1 ∈ ℂ ∧ 𝑅 ∈ ℂ) → ((1 − 𝑅) = 0 ↔ 1 = 𝑅)) | |
| 17 | 16 | necon3bid 3003 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ 𝑅 ∈ ℂ) → ((1 − 𝑅) ≠ 0 ↔ 1 ≠ 𝑅)) |
| 18 | 3, 2, 17 | sylancr 599 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → ((1 − 𝑅) ≠ 0 ↔ 1 ≠ 𝑅)) |
| 19 | 15, 18 | mpbird 260 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (1 − 𝑅) ≠ 0) |
| 20 | 1, 2, 5, 19 | divassd 12152 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → ((𝐴 · 𝑅) / (1 − 𝑅)) = (𝐴 · (𝑅 / (1 − 𝑅)))) |
| 21 | geoisum1 16074 | . . . 4 ⊢ ((𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → Σ𝑘 ∈ ℕ (𝑅↑𝑘) = (𝑅 / (1 − 𝑅))) | |
| 22 | 21 | 3adant1 1148 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → Σ𝑘 ∈ ℕ (𝑅↑𝑘) = (𝑅 / (1 − 𝑅))) |
| 23 | 22 | oveq2d 7456 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (𝐴 · Σ𝑘 ∈ ℕ (𝑅↑𝑘)) = (𝐴 · (𝑅 / (1 − 𝑅)))) |
| 24 | nnuz 13028 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 25 | 1zzd 12751 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → 1 ∈ ℤ) | |
| 26 | oveq2 7448 | . . . . 5 ⊢ (𝑛 = 𝑘 → (𝑅↑𝑛) = (𝑅↑𝑘)) | |
| 27 | eqid 2763 | . . . . 5 ⊢ (𝑛 ∈ ℕ ↦ (𝑅↑𝑛)) = (𝑛 ∈ ℕ ↦ (𝑅↑𝑛)) | |
| 28 | ovex 7473 | . . . . 5 ⊢ (𝑅↑𝑘) ∈ V | |
| 29 | 26, 27, 28 | fvmpt 7013 | . . . 4 ⊢ (𝑘 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (𝑅↑𝑛))‘𝑘) = (𝑅↑𝑘)) |
| 30 | 29 | adantl 487 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (𝑅↑𝑛))‘𝑘) = (𝑅↑𝑘)) |
| 31 | nnnn0 12637 | . . . 4 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0) | |
| 32 | expcl 14246 | . . . 4 ⊢ ((𝑅 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝑅↑𝑘) ∈ ℂ) | |
| 33 | 2, 31, 32 | syl2an 608 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) ∧ 𝑘 ∈ ℕ) → (𝑅↑𝑘) ∈ ℂ) |
| 34 | 1nn0 12646 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 35 | 34 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → 1 ∈ ℕ0) |
| 36 | elnnuz 13029 | . . . . . 6 ⊢ (𝑘 ∈ ℕ ↔ 𝑘 ∈ (ℤ≥‘1)) | |
| 37 | 36, 30 | sylan2br 607 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝑛 ∈ ℕ ↦ (𝑅↑𝑛))‘𝑘) = (𝑅↑𝑘)) |
| 38 | 2, 6, 35, 37 | geolim2 16066 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ⇝ ((𝑅↑1) / (1 − 𝑅))) |
| 39 | seqex 14170 | . . . . 5 ⊢ seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ∈ V | |
| 40 | ovex 7473 | . . . . 5 ⊢ ((𝑅↑1) / (1 − 𝑅)) ∈ V | |
| 41 | 39, 40 | breldm 5896 | . . . 4 ⊢ (seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ⇝ ((𝑅↑1) / (1 − 𝑅)) → seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ∈ dom ⇝ ) |
| 42 | 38, 41 | syl 18 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ∈ dom ⇝ ) |
| 43 | 24, 25, 30, 33, 42, 1 | isummulc2 15954 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (𝐴 · Σ𝑘 ∈ ℕ (𝑅↑𝑘)) = Σ𝑘 ∈ ℕ (𝐴 · (𝑅↑𝑘))) |
| 44 | 20, 23, 43 | 3eqtr2rd 2805 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → Σ𝑘 ∈ ℕ (𝐴 · (𝑅↑𝑘)) = ((𝐴 · 𝑅) / (1 − 𝑅))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5106 ↦ cmpt 5189 dom cdm 5655 ‘cfv 6555 (class class class)co 7440 ℂcc 11222 0cc0 11224 1c1 11225 + caddc 11227 · cmul 11229 < clt 11367 − cmin 11565 / cdiv 11997 ℕcn 12359 ℕ0cn0 12630 ℤ≥cuz 12989 seqcseq 14168 ↑cexp 14228 abscabs 15427 ⇝ cli 15677 Σcsu 15879 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-inf2 9666 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 ax-pre-sup 11302 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-isom 6564 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-er 8742 df-pm 8875 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-sup 9458 df-inf 9459 df-oi 9528 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-div 11998 df-nn 12360 df-2 12429 df-3 12430 df-n0 12631 df-z 12718 df-uz 12990 df-rp 13145 df-fz 13664 df-fzo 13813 df-fl 13956 df-seq 14169 df-exp 14229 df-hash 14499 df-cj 15292 df-re 15293 df-im 15294 df-sqrt 15428 df-abs 15429 df-clim 15681 df-rlim 15682 df-sum 15880 |
| This theorem is used by: 0.999... 16076 |
| Copyright terms: Public domain | W3C validator |