| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > pwm1geoserap1 | GIF version | ||
| Description: The n-th power of a number decreased by 1 expressed by the finite geometric series 1 + 𝐴↑1 + 𝐴↑2 +... + 𝐴↑(𝑁 − 1). (Contributed by AV, 14-Aug-2021.) (Revised by Jim Kingdon, 24-Oct-2022.) |
| Ref | Expression |
|---|---|
| pwm1geoser.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| pwm1geoser.3 | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| pwm1geoserap1.ap | ⊢ (𝜑 → 𝐴 # 1) |
| Ref | Expression |
|---|---|
| pwm1geoserap1 | ⊢ (𝜑 → ((𝐴↑𝑁) − 1) = ((𝐴 − 1) · Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pwm1geoser.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
| 2 | pwm1geoserap1.ap | . . 3 ⊢ (𝜑 → 𝐴 # 1) | |
| 3 | pwm1geoser.3 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 4 | 1, 2, 3 | geoserap 12276 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘) = ((1 − (𝐴↑𝑁)) / (1 − 𝐴))) |
| 5 | eqcom 2240 | . . 3 ⊢ (Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘) = ((1 − (𝐴↑𝑁)) / (1 − 𝐴)) ↔ ((1 − (𝐴↑𝑁)) / (1 − 𝐴)) = Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘)) | |
| 6 | 1cnd 8342 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ) | |
| 7 | 1, 3 | expcld 11113 | . . . . . 6 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℂ) |
| 8 | apsym 8935 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 # 1 ↔ 1 # 𝐴)) | |
| 9 | 1, 6, 8 | syl2anc 415 | . . . . . . 7 ⊢ (𝜑 → (𝐴 # 1 ↔ 1 # 𝐴)) |
| 10 | 2, 9 | mpbid 147 | . . . . . 6 ⊢ (𝜑 → 1 # 𝐴) |
| 11 | 6, 7, 6, 1, 10 | div2subapd 9169 | . . . . 5 ⊢ (𝜑 → ((1 − (𝐴↑𝑁)) / (1 − 𝐴)) = (((𝐴↑𝑁) − 1) / (𝐴 − 1))) |
| 12 | 11 | eqeq1d 2247 | . . . 4 ⊢ (𝜑 → (((1 − (𝐴↑𝑁)) / (1 − 𝐴)) = Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘) ↔ (((𝐴↑𝑁) − 1) / (𝐴 − 1)) = Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘))) |
| 13 | peano2cnm 8592 | . . . . . 6 ⊢ ((𝐴↑𝑁) ∈ ℂ → ((𝐴↑𝑁) − 1) ∈ ℂ) | |
| 14 | 7, 13 | syl 14 | . . . . 5 ⊢ (𝜑 → ((𝐴↑𝑁) − 1) ∈ ℂ) |
| 15 | 0zd 9658 | . . . . . . 7 ⊢ (𝜑 → 0 ∈ ℤ) | |
| 16 | 3 | nn0zd 9768 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 17 | peano2zm 9684 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 18 | 16, 17 | syl 14 | . . . . . . 7 ⊢ (𝜑 → (𝑁 − 1) ∈ ℤ) |
| 19 | 15, 18 | fzfigd 10870 | . . . . . 6 ⊢ (𝜑 → (0...(𝑁 − 1)) ∈ Fin) |
| 20 | 1 | adantr 276 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(𝑁 − 1))) → 𝐴 ∈ ℂ) |
| 21 | elfznn0 10523 | . . . . . . . 8 ⊢ (𝑘 ∈ (0...(𝑁 − 1)) → 𝑘 ∈ ℕ0) | |
| 22 | 21 | adantl 277 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(𝑁 − 1))) → 𝑘 ∈ ℕ0) |
| 23 | 20, 22 | expcld 11113 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(𝑁 − 1))) → (𝐴↑𝑘) ∈ ℂ) |
| 24 | 19, 23 | fsumcl 12169 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘) ∈ ℂ) |
| 25 | peano2cnm 8592 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴 − 1) ∈ ℂ) | |
| 26 | 1, 25 | syl 14 | . . . . 5 ⊢ (𝜑 → (𝐴 − 1) ∈ ℂ) |
| 27 | 1, 6, 2 | subap0d 8973 | . . . . 5 ⊢ (𝜑 → (𝐴 − 1) # 0) |
| 28 | 14, 24, 26, 27 | divmulap2d 9155 | . . . 4 ⊢ (𝜑 → ((((𝐴↑𝑁) − 1) / (𝐴 − 1)) = Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘) ↔ ((𝐴↑𝑁) − 1) = ((𝐴 − 1) · Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘)))) |
| 29 | 12, 28 | bitrd 188 | . . 3 ⊢ (𝜑 → (((1 − (𝐴↑𝑁)) / (1 − 𝐴)) = Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘) ↔ ((𝐴↑𝑁) − 1) = ((𝐴 − 1) · Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘)))) |
| 30 | 5, 29 | bitrid 192 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘) = ((1 − (𝐴↑𝑁)) / (1 − 𝐴)) ↔ ((𝐴↑𝑁) − 1) = ((𝐴 − 1) · Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘)))) |
| 31 | 4, 30 | mpbid 147 | 1 ⊢ (𝜑 → ((𝐴↑𝑁) − 1) = ((𝐴 − 1) · Σ𝑘 ∈ (0...(𝑁 − 1))(𝐴↑𝑘))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 class class class wbr 4130 (class class class)co 6085 ℂcc 8177 0cc0 8179 1c1 8180 · cmul 8184 − cmin 8497 # cap 8910 / cdiv 9003 ℕ0cn0 9565 ℤcz 9646 ...cfz 10413 ↑cexp 10977 Σcsu 12121 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 ax-arch 8298 ax-caucvg 8299 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-isom 5386 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-oadd 6691 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8904 df-ap 8911 df-div 9004 df-inn 9306 df-2 9364 df-3 9365 df-4 9366 df-n0 9566 df-z 9647 df-uz 9924 df-q 10022 df-rp 10057 df-fz 10414 df-fzo 10552 df-seqfrec 10887 df-exp 10978 df-ihash 11217 df-cj 11609 df-re 11610 df-im 11611 df-rsqrt 11766 df-abs 11767 df-clim 12047 df-sumdc 12122 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |