| 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 11258 | . . . 4 ⊢ 1 ∈ ℂ | |
| 4 | subcl 11556 | . . . 4 ⊢ ((1 ∈ ℂ ∧ 𝑅 ∈ ℂ) → (1 − 𝑅) ∈ ℂ) | |
| 5 | 3, 2, 4 | sylancr 599 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (1 − 𝑅) ∈ ℂ) |
| 6 | simp3 1156 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (abs‘𝑅) < 1) | |
| 7 | 1re 11308 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 8 | 7 | ltnri 11419 | . . . . . . 7 ⊢ ¬ 1 < 1 |
| 9 | abs1 15464 | . . . . . . . . 9 ⊢ (abs‘1) = 1 | |
| 10 | fveq2 6885 | . . . . . . . . 9 ⊢ (1 = 𝑅 → (abs‘1) = (abs‘𝑅)) | |
| 11 | 9, 10 | eqtr3id 2809 | . . . . . . . 8 ⊢ (1 = 𝑅 → 1 = (abs‘𝑅)) |
| 12 | 11 | breq1d 5112 | . . . . . . 7 ⊢ (1 = 𝑅 → (1 < 1 ↔ (abs‘𝑅) < 1)) |
| 13 | 8, 12 | mtbii 329 | . . . . . 6 ⊢ (1 = 𝑅 → ¬ (abs‘𝑅) < 1) |
| 14 | 13 | necon2ai 2984 | . . . . 5 ⊢ ((abs‘𝑅) < 1 → 1 ≠ 𝑅) |
| 15 | 6, 14 | syl 18 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → 1 ≠ 𝑅) |
| 16 | subeq0 11584 | . . . . . 6 ⊢ ((1 ∈ ℂ ∧ 𝑅 ∈ ℂ) → ((1 − 𝑅) = 0 ↔ 1 = 𝑅)) | |
| 17 | 16 | necon3bid 2999 | . . . . 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 12128 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → ((𝐴 · 𝑅) / (1 − 𝑅)) = (𝐴 · (𝑅 / (1 − 𝑅)))) |
| 21 | geoisum1 16048 | . . . 4 ⊢ ((𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → Σ𝑘 ∈ ℕ (𝑅↑𝑘) = (𝑅 / (1 − 𝑅))) | |
| 22 | 21 | 3adant1 1148 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → Σ𝑘 ∈ ℕ (𝑅↑𝑘) = (𝑅 / (1 − 𝑅))) |
| 23 | 22 | oveq2d 7436 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (𝐴 · Σ𝑘 ∈ ℕ (𝑅↑𝑘)) = (𝐴 · (𝑅 / (1 − 𝑅)))) |
| 24 | nnuz 13004 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 25 | 1zzd 12727 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → 1 ∈ ℤ) | |
| 26 | oveq2 7428 | . . . . 5 ⊢ (𝑛 = 𝑘 → (𝑅↑𝑛) = (𝑅↑𝑘)) | |
| 27 | eqid 2760 | . . . . 5 ⊢ (𝑛 ∈ ℕ ↦ (𝑅↑𝑛)) = (𝑛 ∈ ℕ ↦ (𝑅↑𝑛)) | |
| 28 | ovex 7453 | . . . . 5 ⊢ (𝑅↑𝑘) ∈ V | |
| 29 | 26, 27, 28 | fvmpt 6993 | . . . 4 ⊢ (𝑘 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (𝑅↑𝑛))‘𝑘) = (𝑅↑𝑘)) |
| 30 | 29 | adantl 487 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (𝑅↑𝑛))‘𝑘) = (𝑅↑𝑘)) |
| 31 | nnnn0 12613 | . . . 4 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0) | |
| 32 | expcl 14222 | . . . 4 ⊢ ((𝑅 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝑅↑𝑘) ∈ ℂ) | |
| 33 | 2, 31, 32 | syl2an 608 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) ∧ 𝑘 ∈ ℕ) → (𝑅↑𝑘) ∈ ℂ) |
| 34 | 1nn0 12622 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 35 | 34 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → 1 ∈ ℕ0) |
| 36 | elnnuz 13005 | . . . . . 6 ⊢ (𝑘 ∈ ℕ ↔ 𝑘 ∈ (ℤ≥‘1)) | |
| 37 | 36, 30 | sylan2br 607 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝑛 ∈ ℕ ↦ (𝑅↑𝑛))‘𝑘) = (𝑅↑𝑘)) |
| 38 | 2, 6, 35, 37 | geolim2 16040 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ⇝ ((𝑅↑1) / (1 − 𝑅))) |
| 39 | seqex 14146 | . . . . 5 ⊢ seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ∈ V | |
| 40 | ovex 7453 | . . . . 5 ⊢ ((𝑅↑1) / (1 − 𝑅)) ∈ V | |
| 41 | 39, 40 | breldm 5889 | . . . 4 ⊢ (seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ⇝ ((𝑅↑1) / (1 − 𝑅)) → seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ∈ dom ⇝ ) |
| 42 | 38, 41 | syl 18 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → seq1( + , (𝑛 ∈ ℕ ↦ (𝑅↑𝑛))) ∈ dom ⇝ ) |
| 43 | 24, 25, 30, 33, 42, 1 | isummulc2 15928 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑅 ∈ ℂ ∧ (abs‘𝑅) < 1) → (𝐴 · Σ𝑘 ∈ ℕ (𝑅↑𝑘)) = Σ𝑘 ∈ ℕ (𝐴 · (𝑅↑𝑘))) |
| 44 | 20, 23, 43 | 3eqtr2rd 2802 | 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 1569 ∈ wcel 2144 ≠ wne 2955 class class class wbr 5102 ↦ cmpt 5185 dom cdm 5650 ‘cfv 6538 (class class class)co 7420 ℂcc 11198 0cc0 11200 1c1 11201 + caddc 11203 · cmul 11205 < clt 11343 − cmin 11541 / cdiv 11973 ℕcn 12335 ℕ0cn0 12606 ℤ≥cuz 12965 seqcseq 14144 ↑cexp 14204 abscabs 15401 ⇝ cli 15651 Σcsu 15853 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9642 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-pm 8850 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 df-inf 9435 df-oi 9504 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-fz 13640 df-fzo 13789 df-fl 13932 df-seq 14145 df-exp 14205 df-hash 14475 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-clim 15655 df-rlim 15656 df-sum 15854 |
| This theorem is used by: 0.999... 16050 |
| Copyright terms: Public domain | W3C validator |