| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > expm1t | Structured version Visualization version GIF version | ||
| Description: Exponentiation in terms of predecessor exponent. (Contributed by NM, 19-Dec-2005.) |
| Ref | Expression |
|---|---|
| expm1t | ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = ((𝐴↑(𝑁 − 1)) · 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nncn 12136 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
| 2 | ax-1cn 11067 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 3 | npcan 11372 | . . . . 5 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
| 4 | 1, 2, 3 | sylancl 586 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((𝑁 − 1) + 1) = 𝑁) |
| 5 | 4 | oveq2d 7365 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝐴↑((𝑁 − 1) + 1)) = (𝐴↑𝑁)) |
| 6 | 5 | adantl 481 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑((𝑁 − 1) + 1)) = (𝐴↑𝑁)) |
| 7 | nnm1nn0 12425 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0) | |
| 8 | expp1 13975 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 − 1) ∈ ℕ0) → (𝐴↑((𝑁 − 1) + 1)) = ((𝐴↑(𝑁 − 1)) · 𝐴)) | |
| 9 | 7, 8 | sylan2 593 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑((𝑁 − 1) + 1)) = ((𝐴↑(𝑁 − 1)) · 𝐴)) |
| 10 | 6, 9 | eqtr3d 2766 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = ((𝐴↑(𝑁 − 1)) · 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 (class class class)co 7349 ℂcc 11007 1c1 11010 + caddc 11012 · cmul 11014 − cmin 11347 ℕcn 12128 ℕ0cn0 12384 ↑cexp 13968 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-n0 12385 df-z 12472 df-uz 12736 df-seq 13909 df-exp 13969 |
| This theorem is referenced by: expgt1 14007 digit1 14144 faclbnd4lem1 14200 binomlem 15736 incexc 15744 iddvdsexp 16190 bitsfzolem 16345 phiprmpw 16687 fermltl 16695 prmpwdvds 16816 dvexp 25855 abelthlem6 26344 ftalem1 26981 perfect1 27137 perfect 27140 knoppndvlem2 36487 fltnltalem 42635 jm2.18 42961 jm2.22 42968 itgsinexp 45936 fmtnoodd 47517 perfectALTV 47707 fpprwppr 47723 fpprwpprb 47724 |
| Copyright terms: Public domain | W3C validator |