MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  efexp Structured version   Visualization version   GIF version

Theorem efexp 16017
Description: The exponential of an integer power. Corollary 15-4.4 of [Gleason] p. 309, restricted to integers. (Contributed by NM, 13-Jan-2006.) (Revised by Mario Carneiro, 5-Jun-2014.)
Assertion
Ref Expression
efexp ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝑁 · 𝐴)) = ((exp‘𝐴)↑𝑁))

Proof of Theorem efexp
Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 zcn 12484 . . . 4 (𝑁 ∈ ℤ → 𝑁 ∈ ℂ)
2 mulcom 11103 . . . 4 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 · 𝑁) = (𝑁 · 𝐴))
31, 2sylan2 593 . . 3 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (𝐴 · 𝑁) = (𝑁 · 𝐴))
43fveq2d 6835 . 2 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝐴 · 𝑁)) = (exp‘(𝑁 · 𝐴)))
5 oveq2 7363 . . . . . 6 (𝑗 = 0 → (𝐴 · 𝑗) = (𝐴 · 0))
65fveq2d 6835 . . . . 5 (𝑗 = 0 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 0)))
7 oveq2 7363 . . . . 5 (𝑗 = 0 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑0))
86, 7eqeq12d 2749 . . . 4 (𝑗 = 0 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 0)) = ((exp‘𝐴)↑0)))
9 oveq2 7363 . . . . . 6 (𝑗 = 𝑘 → (𝐴 · 𝑗) = (𝐴 · 𝑘))
109fveq2d 6835 . . . . 5 (𝑗 = 𝑘 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 𝑘)))
11 oveq2 7363 . . . . 5 (𝑗 = 𝑘 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑𝑘))
1210, 11eqeq12d 2749 . . . 4 (𝑗 = 𝑘 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)))
13 oveq2 7363 . . . . . 6 (𝑗 = (𝑘 + 1) → (𝐴 · 𝑗) = (𝐴 · (𝑘 + 1)))
1413fveq2d 6835 . . . . 5 (𝑗 = (𝑘 + 1) → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · (𝑘 + 1))))
15 oveq2 7363 . . . . 5 (𝑗 = (𝑘 + 1) → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑(𝑘 + 1)))
1614, 15eqeq12d 2749 . . . 4 (𝑗 = (𝑘 + 1) → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1))))
17 oveq2 7363 . . . . . 6 (𝑗 = -𝑘 → (𝐴 · 𝑗) = (𝐴 · -𝑘))
1817fveq2d 6835 . . . . 5 (𝑗 = -𝑘 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · -𝑘)))
19 oveq2 7363 . . . . 5 (𝑗 = -𝑘 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑-𝑘))
2018, 19eqeq12d 2749 . . . 4 (𝑗 = -𝑘 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘)))
21 oveq2 7363 . . . . . 6 (𝑗 = 𝑁 → (𝐴 · 𝑗) = (𝐴 · 𝑁))
2221fveq2d 6835 . . . . 5 (𝑗 = 𝑁 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 𝑁)))
23 oveq2 7363 . . . . 5 (𝑗 = 𝑁 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑𝑁))
2422, 23eqeq12d 2749 . . . 4 (𝑗 = 𝑁 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁)))
25 ef0 16005 . . . . 5 (exp‘0) = 1
26 mul01 11303 . . . . . 6 (𝐴 ∈ ℂ → (𝐴 · 0) = 0)
2726fveq2d 6835 . . . . 5 (𝐴 ∈ ℂ → (exp‘(𝐴 · 0)) = (exp‘0))
28 efcl 15996 . . . . . 6 (𝐴 ∈ ℂ → (exp‘𝐴) ∈ ℂ)
2928exp0d 14054 . . . . 5 (𝐴 ∈ ℂ → ((exp‘𝐴)↑0) = 1)
3025, 27, 293eqtr4a 2794 . . . 4 (𝐴 ∈ ℂ → (exp‘(𝐴 · 0)) = ((exp‘𝐴)↑0))
31 oveq1 7362 . . . . . . 7 ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
3231adantl 481 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
33 nn0cn 12402 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
34 ax-1cn 11075 . . . . . . . . . . . 12 1 ∈ ℂ
35 adddi 11106 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + (𝐴 · 1)))
3634, 35mp3an3 1452 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + (𝐴 · 1)))
37 mulrid 11121 . . . . . . . . . . . . 13 (𝐴 ∈ ℂ → (𝐴 · 1) = 𝐴)
3837adantr 480 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · 1) = 𝐴)
3938oveq2d 7371 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → ((𝐴 · 𝑘) + (𝐴 · 1)) = ((𝐴 · 𝑘) + 𝐴))
4036, 39eqtrd 2768 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + 𝐴))
4133, 40sylan2 593 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + 𝐴))
4241fveq2d 6835 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘(𝐴 · (𝑘 + 1))) = (exp‘((𝐴 · 𝑘) + 𝐴)))
43 mulcl 11101 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · 𝑘) ∈ ℂ)
4433, 43sylan2 593 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴 · 𝑘) ∈ ℂ)
45 simpl 482 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → 𝐴 ∈ ℂ)
46 efadd 16008 . . . . . . . . 9 (((𝐴 · 𝑘) ∈ ℂ ∧ 𝐴 ∈ ℂ) → (exp‘((𝐴 · 𝑘) + 𝐴)) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4744, 45, 46syl2anc 584 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘((𝐴 · 𝑘) + 𝐴)) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4842, 47eqtrd 2768 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4948adantr 480 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
50 expp1 13982 . . . . . . . 8 (((exp‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5128, 50sylan 580 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5251adantr 480 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5332, 49, 523eqtr4d 2778 . . . . 5 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1)))
5453exp31 419 . . . 4 (𝐴 ∈ ℂ → (𝑘 ∈ ℕ0 → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1)))))
55 oveq2 7363 . . . . . 6 ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (1 / (exp‘(𝐴 · 𝑘))) = (1 / ((exp‘𝐴)↑𝑘)))
56 nncn 12144 . . . . . . . . . 10 (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
57 mulneg2 11565 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · -𝑘) = -(𝐴 · 𝑘))
5856, 57sylan2 593 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝐴 · -𝑘) = -(𝐴 · 𝑘))
5958fveq2d 6835 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘(𝐴 · -𝑘)) = (exp‘-(𝐴 · 𝑘)))
6056, 43sylan2 593 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝐴 · 𝑘) ∈ ℂ)
61 efneg 16014 . . . . . . . . 9 ((𝐴 · 𝑘) ∈ ℂ → (exp‘-(𝐴 · 𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
6260, 61syl 17 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘-(𝐴 · 𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
6359, 62eqtrd 2768 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘(𝐴 · -𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
64 nnnn0 12399 . . . . . . . 8 (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0)
65 expneg 13983 . . . . . . . 8 (((exp‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑-𝑘) = (1 / ((exp‘𝐴)↑𝑘)))
6628, 64, 65syl2an 596 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘𝐴)↑-𝑘) = (1 / ((exp‘𝐴)↑𝑘)))
6763, 66eqeq12d 2749 . . . . . 6 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘) ↔ (1 / (exp‘(𝐴 · 𝑘))) = (1 / ((exp‘𝐴)↑𝑘))))
6855, 67imbitrrid 246 . . . . 5 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘)))
6968ex 412 . . . 4 (𝐴 ∈ ℂ → (𝑘 ∈ ℕ → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘))))
708, 12, 16, 20, 24, 30, 54, 69zindd 12584 . . 3 (𝐴 ∈ ℂ → (𝑁 ∈ ℤ → (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁)))
7170imp 406 . 2 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁))
724, 71eqtr3d 2770 1 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝑁 · 𝐴)) = ((exp‘𝐴)↑𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  cfv 6489  (class class class)co 7355  cc 11015  0cc0 11017  1c1 11018   + caddc 11020   · cmul 11022  -cneg 11356   / cdiv 11785  cn 12136  0cn0 12392  cz 12479  cexp 13975  expce 15975
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-inf2 9542  ax-cnex 11073  ax-resscn 11074  ax-1cn 11075  ax-icn 11076  ax-addcl 11077  ax-addrcl 11078  ax-mulcl 11079  ax-mulrcl 11080  ax-mulcom 11081  ax-addass 11082  ax-mulass 11083  ax-distr 11084  ax-i2m1 11085  ax-1ne0 11086  ax-1rid 11087  ax-rnegex 11088  ax-rrecex 11089  ax-cnre 11090  ax-pre-lttri 11091  ax-pre-lttrn 11092  ax-pre-ltadd 11093  ax-pre-mulgt0 11094  ax-pre-sup 11095
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-se 5575  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-isom 6498  df-riota 7312  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-er 8631  df-pm 8762  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-sup 9337  df-inf 9338  df-oi 9407  df-card 9843  df-pnf 11159  df-mnf 11160  df-xr 11161  df-ltxr 11162  df-le 11163  df-sub 11357  df-neg 11358  df-div 11786  df-nn 12137  df-2 12199  df-3 12200  df-n0 12393  df-z 12480  df-uz 12743  df-rp 12897  df-ico 13258  df-fz 13415  df-fzo 13562  df-fl 13703  df-seq 13916  df-exp 13976  df-fac 14188  df-bc 14217  df-hash 14245  df-shft 14981  df-cj 15013  df-re 15014  df-im 15015  df-sqrt 15149  df-abs 15150  df-limsup 15385  df-clim 15402  df-rlim 15403  df-sum 15601  df-ef 15981
This theorem is referenced by:  efzval  16018  efgt0  16019  tanval3  16050  demoivre  16116  ef2kpi  26434  efif1olem4  26501  explog  26550  reexplog  26551  relogexp  26552  tanarg  26575  root1eq1  26712  cos9thpiminplylem3  33869  cos9thpiminplylem5  33871  vtsprod  34724
  Copyright terms: Public domain W3C validator