| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > expp1 | Structured version Visualization version 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. When 𝐴 is nonzero, this holds for all integers 𝑁, see expneg 14096. (Contributed by NM, 20-May-2005.) (Revised by Mario Carneiro, 2-Jul-2013.) |
| Ref | Expression |
|---|---|
| expp1 | ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elnn0 12497 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | seqp1 14043 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘1) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1)))) | |
| 3 | nnuz 12892 | . . . . . . 7 ⊢ ℕ = (ℤ≥‘1) | |
| 4 | 2, 3 | eleq2s 2883 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1)))) |
| 5 | 4 | adantl 486 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1)))) |
| 6 | peano2nn 12236 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 7 | fvconst2g 7190 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴) | |
| 8 | 6, 7 | sylan2 604 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴) |
| 9 | 8 | oveq2d 7416 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
| 10 | 5, 9 | eqtrd 2800 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
| 11 | expnnval 14091 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1))) | |
| 12 | 6, 11 | sylan2 604 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1))) |
| 13 | expnnval 14091 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) | |
| 14 | 13 | oveq1d 7415 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) · 𝐴) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
| 15 | 10, 12, 14 | 3eqtr4d 2810 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| 16 | exp1 14094 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴) | |
| 17 | mullid 11195 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) | |
| 18 | 16, 17 | eqtr4d 2803 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = (1 · 𝐴)) |
| 19 | 18 | adantr 485 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑1) = (1 · 𝐴)) |
| 20 | simpr 489 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → 𝑁 = 0) | |
| 21 | 20 | oveq1d 7415 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = (0 + 1)) |
| 22 | 0p1e1 12352 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 23 | 21, 22 | eqtrdi 2816 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = 1) |
| 24 | 23 | oveq2d 7416 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = (𝐴↑1)) |
| 25 | oveq2 7408 | . . . . . 6 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0)) | |
| 26 | exp0 14092 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) | |
| 27 | 25, 26 | sylan9eqr 2822 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑𝑁) = 1) |
| 28 | 27 | oveq1d 7415 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → ((𝐴↑𝑁) · 𝐴) = (1 · 𝐴)) |
| 29 | 19, 24, 28 | 3eqtr4d 2810 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| 30 | 15, 29 | jaodan 972 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| 31 | 1, 30 | sylan2b 605 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1563 ∈ wcel 2145 {csn 4585 × cxp 5650 ‘cfv 6525 (class class class)co 7400 ℂcc 11086 0cc0 11088 1c1 11089 + caddc 11091 · cmul 11093 ℕcn 12224 ℕ0cn0 12495 ℤ≥cuz 12853 seqcseq 14028 ↑cexp 14088 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-n0 12496 df-z 12583 df-uz 12854 df-seq 14029 df-exp 14089 |
| This theorem is referenced by: expcllem 14099 expm1t 14117 expeq0 14119 mulexp 14128 expadd 14131 expmul 14134 sqval 14141 expp1d 14174 leexp2r 14201 leexp1a 14202 cu2 14227 i3 14230 binom3 14251 bernneq 14256 modexp 14265 faclbnd 14317 faclbnd2 14318 faclbnd4lem1 14320 faclbnd6 14326 cjexp 15191 absexp 15345 binomlem 15873 climcndslem1 15893 climcndslem2 15894 pwdif 15912 geolim 15914 geo2sum 15917 efexp 16147 demoivreALT 16247 rpnnen2lem11 16270 pwp1fsum 16439 prmdvdsexp 16764 pcexp 16909 prmreclem6 16971 numexpp1 17127 2exp7 17137 cnfldexp 21515 expcn 24992 mbfi1fseqlem5 25839 dvexp 26073 aaliou3lem2 26465 tangtx 26628 cxpmul2 26812 mcubic 26970 cubic2 26971 binom4 26973 dquartlem2 26975 quart1lem 26978 quart1 26979 quartlem1 26980 log2cnv 27067 log2ublem2 27070 log2ub 27072 basellem3 27205 chtublem 27333 perfectlem1 27351 perfectlem2 27352 bclbnd 27402 bposlem8 27413 dchrisum0flblem1 27630 pntlemo 27729 qabvexp 27748 psgnfzto1st 33338 oddpwdc 34661 hgt750lem 34955 subfacval2 35550 sinccvglem 36035 heiborlem6 38327 bfplem1 38333 3lexlogpow5ineq1 42683 perfectALTVlem1 48341 perfectALTVlem2 48342 altgsumbcALT 48984 |
| Copyright terms: Public domain | W3C validator |