| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > expp1 | GIF version | ||
| Description: Value of a complex number raised to a nonnegative integer power plus one. Part of Definition 10-4.1 of [Gleason] p. 134. (Contributed by NM, 20-May-2005.) (Revised by Mario Carneiro, 2-Jul-2013.) |
| Ref | Expression |
|---|---|
| expp1 | ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elnn0 9494 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | simpr 110 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) | |
| 3 | elnnuz 9887 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ ↔ 𝑁 ∈ (ℤ≥‘1)) | |
| 4 | 2, 3 | sylib 122 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ (ℤ≥‘1)) |
| 5 | simpll 527 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (ℤ≥‘1)) → 𝐴 ∈ ℂ) | |
| 6 | elnnuz 9887 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℕ ↔ 𝑥 ∈ (ℤ≥‘1)) | |
| 7 | fvconst2g 5897 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℕ) → ((ℕ × {𝐴})‘𝑥) = 𝐴) | |
| 8 | 7 | eleq1d 2301 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℕ) → (((ℕ × {𝐴})‘𝑥) ∈ ℂ ↔ 𝐴 ∈ ℂ)) |
| 9 | 6, 8 | sylan2br 288 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ (ℤ≥‘1)) → (((ℕ × {𝐴})‘𝑥) ∈ ℂ ↔ 𝐴 ∈ ℂ)) |
| 10 | 9 | adantlr 477 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (ℤ≥‘1)) → (((ℕ × {𝐴})‘𝑥) ∈ ℂ ↔ 𝐴 ∈ ℂ)) |
| 11 | 5, 10 | mpbird 167 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (ℤ≥‘1)) → ((ℕ × {𝐴})‘𝑥) ∈ ℂ) |
| 12 | mulcl 8250 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
| 13 | 12 | adantl 277 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 · 𝑦) ∈ ℂ) |
| 14 | 4, 11, 13 | seq3p1 10823 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1)))) |
| 15 | peano2nn 9245 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 16 | fvconst2g 5897 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴) | |
| 17 | 15, 16 | sylan2 286 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴) |
| 18 | 17 | oveq2d 6065 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
| 19 | 14, 18 | eqtrd 2265 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
| 20 | expnnval 10900 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1))) | |
| 21 | 15, 20 | sylan2 286 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1))) |
| 22 | expnnval 10900 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) | |
| 23 | 22 | oveq1d 6064 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) · 𝐴) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
| 24 | 19, 21, 23 | 3eqtr4d 2275 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| 25 | exp1 10903 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴) | |
| 26 | mullid 8268 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) | |
| 27 | 25, 26 | eqtr4d 2268 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = (1 · 𝐴)) |
| 28 | 27 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑1) = (1 · 𝐴)) |
| 29 | simpr 110 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → 𝑁 = 0) | |
| 30 | 29 | oveq1d 6064 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = (0 + 1)) |
| 31 | 0p1e1 9347 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 32 | 30, 31 | eqtrdi 2281 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = 1) |
| 33 | 32 | oveq2d 6065 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = (𝐴↑1)) |
| 34 | oveq2 6057 | . . . . . 6 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0)) | |
| 35 | exp0 10901 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) | |
| 36 | 34, 35 | sylan9eqr 2287 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑𝑁) = 1) |
| 37 | 36 | oveq1d 6064 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → ((𝐴↑𝑁) · 𝐴) = (1 · 𝐴)) |
| 38 | 28, 33, 37 | 3eqtr4d 2275 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| 39 | 24, 38 | jaodan 805 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| 40 | 1, 39 | sylan2b 287 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 = wceq 1398 ∈ wcel 2203 {csn 3688 × cxp 4746 ‘cfv 5351 (class class class)co 6049 ℂcc 8121 0cc0 8123 1c1 8124 + caddc 8126 · cmul 8128 ℕcn 9233 ℕ0cn0 9492 ℤ≥cuz 9849 seqcseq 10805 ↑cexp 10896 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-mulrcl 8222 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-precex 8233 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-apti 8238 ax-pre-ltadd 8239 ax-pre-mulgt0 8240 ax-pre-mulext 8241 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-po 4416 df-iso 4417 df-iord 4486 df-on 4488 df-ilim 4489 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-frec 6621 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-reap 8845 df-ap 8852 df-div 8943 df-inn 9234 df-n0 9493 df-z 9574 df-uz 9850 df-seqfrec 10806 df-exp 10897 |
| This theorem is referenced by: expcllem 10908 expm1t 10925 expap0 10927 mulexp 10936 expadd 10939 expmul 10942 leexp2r 10951 leexp1a 10952 sqval 10955 cu2 10996 i3 10999 binom3 11015 bernneq 11018 modqexp 11024 expp1d 11032 faclbnd 11099 faclbnd2 11100 faclbnd6 11102 cjexp 11571 absexp 11757 binomlem 12162 geolim 12190 geo2sum 12193 efexp 12361 demoivreALT 12453 prmdvdsexp 12838 oddpwdclemodd 12862 pcexp 13000 numexpp1 13115 2exp7 13125 cnfldexp 14712 expcn 15421 expcncf 15461 dvexp 15563 tangtx 15690 rpcxpmul2 15765 binom4 15831 perfectlem1 15854 perfectlem2 15855 |
| Copyright terms: Public domain | W3C validator |