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

Theorem efexp 15454
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 11987 . . . 4 (𝑁 ∈ ℤ → 𝑁 ∈ ℂ)
2 mulcom 10623 . . . 4 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 · 𝑁) = (𝑁 · 𝐴))
31, 2sylan2 594 . . 3 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (𝐴 · 𝑁) = (𝑁 · 𝐴))
43fveq2d 6674 . 2 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝐴 · 𝑁)) = (exp‘(𝑁 · 𝐴)))
5 oveq2 7164 . . . . . 6 (𝑗 = 0 → (𝐴 · 𝑗) = (𝐴 · 0))
65fveq2d 6674 . . . . 5 (𝑗 = 0 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 0)))
7 oveq2 7164 . . . . 5 (𝑗 = 0 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑0))
86, 7eqeq12d 2837 . . . 4 (𝑗 = 0 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 0)) = ((exp‘𝐴)↑0)))
9 oveq2 7164 . . . . . 6 (𝑗 = 𝑘 → (𝐴 · 𝑗) = (𝐴 · 𝑘))
109fveq2d 6674 . . . . 5 (𝑗 = 𝑘 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 𝑘)))
11 oveq2 7164 . . . . 5 (𝑗 = 𝑘 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑𝑘))
1210, 11eqeq12d 2837 . . . 4 (𝑗 = 𝑘 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)))
13 oveq2 7164 . . . . . 6 (𝑗 = (𝑘 + 1) → (𝐴 · 𝑗) = (𝐴 · (𝑘 + 1)))
1413fveq2d 6674 . . . . 5 (𝑗 = (𝑘 + 1) → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · (𝑘 + 1))))
15 oveq2 7164 . . . . 5 (𝑗 = (𝑘 + 1) → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑(𝑘 + 1)))
1614, 15eqeq12d 2837 . . . 4 (𝑗 = (𝑘 + 1) → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1))))
17 oveq2 7164 . . . . . 6 (𝑗 = -𝑘 → (𝐴 · 𝑗) = (𝐴 · -𝑘))
1817fveq2d 6674 . . . . 5 (𝑗 = -𝑘 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · -𝑘)))
19 oveq2 7164 . . . . 5 (𝑗 = -𝑘 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑-𝑘))
2018, 19eqeq12d 2837 . . . 4 (𝑗 = -𝑘 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘)))
21 oveq2 7164 . . . . . 6 (𝑗 = 𝑁 → (𝐴 · 𝑗) = (𝐴 · 𝑁))
2221fveq2d 6674 . . . . 5 (𝑗 = 𝑁 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 𝑁)))
23 oveq2 7164 . . . . 5 (𝑗 = 𝑁 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑𝑁))
2422, 23eqeq12d 2837 . . . 4 (𝑗 = 𝑁 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁)))
25 ef0 15444 . . . . 5 (exp‘0) = 1
26 mul01 10819 . . . . . 6 (𝐴 ∈ ℂ → (𝐴 · 0) = 0)
2726fveq2d 6674 . . . . 5 (𝐴 ∈ ℂ → (exp‘(𝐴 · 0)) = (exp‘0))
28 efcl 15436 . . . . . 6 (𝐴 ∈ ℂ → (exp‘𝐴) ∈ ℂ)
2928exp0d 13505 . . . . 5 (𝐴 ∈ ℂ → ((exp‘𝐴)↑0) = 1)
3025, 27, 293eqtr4a 2882 . . . 4 (𝐴 ∈ ℂ → (exp‘(𝐴 · 0)) = ((exp‘𝐴)↑0))
31 oveq1 7163 . . . . . . 7 ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
3231adantl 484 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
33 nn0cn 11908 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
34 ax-1cn 10595 . . . . . . . . . . . 12 1 ∈ ℂ
35 adddi 10626 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + (𝐴 · 1)))
3634, 35mp3an3 1446 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + (𝐴 · 1)))
37 mulid1 10639 . . . . . . . . . . . . 13 (𝐴 ∈ ℂ → (𝐴 · 1) = 𝐴)
3837adantr 483 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · 1) = 𝐴)
3938oveq2d 7172 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → ((𝐴 · 𝑘) + (𝐴 · 1)) = ((𝐴 · 𝑘) + 𝐴))
4036, 39eqtrd 2856 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + 𝐴))
4133, 40sylan2 594 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + 𝐴))
4241fveq2d 6674 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘(𝐴 · (𝑘 + 1))) = (exp‘((𝐴 · 𝑘) + 𝐴)))
43 mulcl 10621 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · 𝑘) ∈ ℂ)
4433, 43sylan2 594 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴 · 𝑘) ∈ ℂ)
45 simpl 485 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → 𝐴 ∈ ℂ)
46 efadd 15447 . . . . . . . . 9 (((𝐴 · 𝑘) ∈ ℂ ∧ 𝐴 ∈ ℂ) → (exp‘((𝐴 · 𝑘) + 𝐴)) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4744, 45, 46syl2anc 586 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘((𝐴 · 𝑘) + 𝐴)) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4842, 47eqtrd 2856 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4948adantr 483 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
50 expp1 13437 . . . . . . . 8 (((exp‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5128, 50sylan 582 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5251adantr 483 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5332, 49, 523eqtr4d 2866 . . . . 5 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1)))
5453exp31 422 . . . 4 (𝐴 ∈ ℂ → (𝑘 ∈ ℕ0 → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1)))))
55 oveq2 7164 . . . . . 6 ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (1 / (exp‘(𝐴 · 𝑘))) = (1 / ((exp‘𝐴)↑𝑘)))
56 nncn 11646 . . . . . . . . . 10 (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
57 mulneg2 11077 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · -𝑘) = -(𝐴 · 𝑘))
5856, 57sylan2 594 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝐴 · -𝑘) = -(𝐴 · 𝑘))
5958fveq2d 6674 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘(𝐴 · -𝑘)) = (exp‘-(𝐴 · 𝑘)))
6056, 43sylan2 594 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝐴 · 𝑘) ∈ ℂ)
61 efneg 15451 . . . . . . . . 9 ((𝐴 · 𝑘) ∈ ℂ → (exp‘-(𝐴 · 𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
6260, 61syl 17 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘-(𝐴 · 𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
6359, 62eqtrd 2856 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘(𝐴 · -𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
64 nnnn0 11905 . . . . . . . 8 (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0)
65 expneg 13438 . . . . . . . 8 (((exp‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑-𝑘) = (1 / ((exp‘𝐴)↑𝑘)))
6628, 64, 65syl2an 597 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘𝐴)↑-𝑘) = (1 / ((exp‘𝐴)↑𝑘)))
6763, 66eqeq12d 2837 . . . . . 6 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘) ↔ (1 / (exp‘(𝐴 · 𝑘))) = (1 / ((exp‘𝐴)↑𝑘))))
6855, 67syl5ibr 248 . . . . 5 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘)))
6968ex 415 . . . 4 (𝐴 ∈ ℂ → (𝑘 ∈ ℕ → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘))))
708, 12, 16, 20, 24, 30, 54, 69zindd 12084 . . 3 (𝐴 ∈ ℂ → (𝑁 ∈ ℤ → (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁)))
7170imp 409 . 2 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁))
724, 71eqtr3d 2858 1 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝑁 · 𝐴)) = ((exp‘𝐴)↑𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wcel 2114  cfv 6355  (class class class)co 7156  cc 10535  0cc0 10537  1c1 10538   + caddc 10540   · cmul 10542  -cneg 10871   / cdiv 11297  cn 11638  0cn0 11898  cz 11982  cexp 13430  expce 15415
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-inf2 9104  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614  ax-pre-sup 10615  ax-addf 10616  ax-mulf 10617
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-se 5515  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-isom 6364  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-1o 8102  df-oadd 8106  df-er 8289  df-pm 8409  df-en 8510  df-dom 8511  df-sdom 8512  df-fin 8513  df-sup 8906  df-inf 8907  df-oi 8974  df-card 9368  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-div 11298  df-nn 11639  df-2 11701  df-3 11702  df-n0 11899  df-z 11983  df-uz 12245  df-rp 12391  df-ico 12745  df-fz 12894  df-fzo 13035  df-fl 13163  df-seq 13371  df-exp 13431  df-fac 13635  df-bc 13664  df-hash 13692  df-shft 14426  df-cj 14458  df-re 14459  df-im 14460  df-sqrt 14594  df-abs 14595  df-limsup 14828  df-clim 14845  df-rlim 14846  df-sum 15043  df-ef 15421
This theorem is referenced by:  efzval  15455  efgt0  15456  tanval3  15487  demoivre  15553  ef2kpi  25064  efif1olem4  25129  explog  25177  reexplog  25178  relogexp  25179  tanarg  25202  root1eq1  25336  vtsprod  31910
  Copyright terms: Public domain W3C validator