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

Theorem efexp 16157
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 12596 . . . 4 (𝑁 ∈ ℤ → 𝑁 ∈ ℂ)
2 mulcom 11186 . . . 4 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 · 𝑁) = (𝑁 · 𝐴))
31, 2sylan2 604 . . 3 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (𝐴 · 𝑁) = (𝑁 · 𝐴))
43fveq2d 6886 . 2 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝐴 · 𝑁)) = (exp‘(𝑁 · 𝐴)))
5 oveq2 7419 . . . . . 6 (𝑗 = 0 → (𝐴 · 𝑗) = (𝐴 · 0))
65fveq2d 6886 . . . . 5 (𝑗 = 0 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 0)))
7 oveq2 7419 . . . . 5 (𝑗 = 0 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑0))
86, 7eqeq12d 2785 . . . 4 (𝑗 = 0 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 0)) = ((exp‘𝐴)↑0)))
9 oveq2 7419 . . . . . 6 (𝑗 = 𝑘 → (𝐴 · 𝑗) = (𝐴 · 𝑘))
109fveq2d 6886 . . . . 5 (𝑗 = 𝑘 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 𝑘)))
11 oveq2 7419 . . . . 5 (𝑗 = 𝑘 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑𝑘))
1210, 11eqeq12d 2785 . . . 4 (𝑗 = 𝑘 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)))
13 oveq2 7419 . . . . . 6 (𝑗 = (𝑘 + 1) → (𝐴 · 𝑗) = (𝐴 · (𝑘 + 1)))
1413fveq2d 6886 . . . . 5 (𝑗 = (𝑘 + 1) → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · (𝑘 + 1))))
15 oveq2 7419 . . . . 5 (𝑗 = (𝑘 + 1) → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑(𝑘 + 1)))
1614, 15eqeq12d 2785 . . . 4 (𝑗 = (𝑘 + 1) → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1))))
17 oveq2 7419 . . . . . 6 (𝑗 = -𝑘 → (𝐴 · 𝑗) = (𝐴 · -𝑘))
1817fveq2d 6886 . . . . 5 (𝑗 = -𝑘 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · -𝑘)))
19 oveq2 7419 . . . . 5 (𝑗 = -𝑘 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑-𝑘))
2018, 19eqeq12d 2785 . . . 4 (𝑗 = -𝑘 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘)))
21 oveq2 7419 . . . . . 6 (𝑗 = 𝑁 → (𝐴 · 𝑗) = (𝐴 · 𝑁))
2221fveq2d 6886 . . . . 5 (𝑗 = 𝑁 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 𝑁)))
23 oveq2 7419 . . . . 5 (𝑗 = 𝑁 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑𝑁))
2422, 23eqeq12d 2785 . . . 4 (𝑗 = 𝑁 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁)))
25 ef0 16145 . . . . 5 (exp‘0) = 1
26 mul01 11389 . . . . . 6 (𝐴 ∈ ℂ → (𝐴 · 0) = 0)
2726fveq2d 6886 . . . . 5 (𝐴 ∈ ℂ → (exp‘(𝐴 · 0)) = (exp‘0))
28 efcl 16136 . . . . . 6 (𝐴 ∈ ℂ → (exp‘𝐴) ∈ ℂ)
2928exp0d 14176 . . . . 5 (𝐴 ∈ ℂ → ((exp‘𝐴)↑0) = 1)
3025, 27, 293eqtr4a 2830 . . . 4 (𝐴 ∈ ℂ → (exp‘(𝐴 · 0)) = ((exp‘𝐴)↑0))
31 oveq1 7418 . . . . . . 7 ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
3231adantl 486 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
33 nn0cn 12514 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
34 ax-1cn 11158 . . . . . . . . . . . 12 1 ∈ ℂ
35 adddi 11189 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + (𝐴 · 1)))
3634, 35mp3an3 1476 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + (𝐴 · 1)))
37 mulrid 11206 . . . . . . . . . . . . 13 (𝐴 ∈ ℂ → (𝐴 · 1) = 𝐴)
3837adantr 485 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · 1) = 𝐴)
3938oveq2d 7427 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → ((𝐴 · 𝑘) + (𝐴 · 1)) = ((𝐴 · 𝑘) + 𝐴))
4036, 39eqtrd 2804 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + 𝐴))
4133, 40sylan2 604 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + 𝐴))
4241fveq2d 6886 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘(𝐴 · (𝑘 + 1))) = (exp‘((𝐴 · 𝑘) + 𝐴)))
43 mulcl 11184 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · 𝑘) ∈ ℂ)
4433, 43sylan2 604 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴 · 𝑘) ∈ ℂ)
45 simpl 487 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → 𝐴 ∈ ℂ)
46 efadd 16148 . . . . . . . . 9 (((𝐴 · 𝑘) ∈ ℂ ∧ 𝐴 ∈ ℂ) → (exp‘((𝐴 · 𝑘) + 𝐴)) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4744, 45, 46syl2anc 595 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘((𝐴 · 𝑘) + 𝐴)) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4842, 47eqtrd 2804 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
4948adantr 485 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)))
50 expp1 14104 . . . . . . . 8 (((exp‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5128, 50sylan 591 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5251adantr 485 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → ((exp‘𝐴)↑(𝑘 + 1)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
5332, 49, 523eqtr4d 2814 . . . . 5 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1)))
5453exp31 424 . . . 4 (𝐴 ∈ ℂ → (𝑘 ∈ ℕ0 → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1)))))
55 oveq2 7419 . . . . . 6 ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (1 / (exp‘(𝐴 · 𝑘))) = (1 / ((exp‘𝐴)↑𝑘)))
56 nncn 12241 . . . . . . . . . 10 (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
57 mulneg2 11651 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · -𝑘) = -(𝐴 · 𝑘))
5856, 57sylan2 604 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝐴 · -𝑘) = -(𝐴 · 𝑘))
5958fveq2d 6886 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘(𝐴 · -𝑘)) = (exp‘-(𝐴 · 𝑘)))
6056, 43sylan2 604 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝐴 · 𝑘) ∈ ℂ)
61 efneg 16154 . . . . . . . . 9 ((𝐴 · 𝑘) ∈ ℂ → (exp‘-(𝐴 · 𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
6260, 61syl 18 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘-(𝐴 · 𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
6359, 62eqtrd 2804 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘(𝐴 · -𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
64 nnnn0 12511 . . . . . . . 8 (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0)
65 expneg 14105 . . . . . . . 8 (((exp‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((exp‘𝐴)↑-𝑘) = (1 / ((exp‘𝐴)↑𝑘)))
6628, 64, 65syl2an 607 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘𝐴)↑-𝑘) = (1 / ((exp‘𝐴)↑𝑘)))
6763, 66eqeq12d 2785 . . . . . 6 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘) ↔ (1 / (exp‘(𝐴 · 𝑘))) = (1 / ((exp‘𝐴)↑𝑘))))
6855, 67imbitrrid 249 . . . . 5 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘)))
6968ex 417 . . . 4 (𝐴 ∈ ℂ → (𝑘 ∈ ℕ → ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘))))
708, 12, 16, 20, 24, 30, 54, 69zindd 12697 . . 3 (𝐴 ∈ ℂ → (𝑁 ∈ ℤ → (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁)))
7170imp 411 . 2 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁))
724, 71eqtr3d 2806 1 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝑁 · 𝐴)) = ((exp‘𝐴)↑𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1567  wcel 2149  cfv 6537  (class class class)co 7411  cc 11098  0cc0 11100  1c1 11101   + caddc 11103   · cmul 11105  -cneg 11442   / cdiv 11871  cn 12233  0cn0 12504  cz 12591  cexp 14097  expce 16115
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-inf2 9610  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177  ax-pre-sup 11178
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-pm 8827  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-sup 9402  df-inf 9403  df-oi 9472  df-card 9925  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-div 11872  df-nn 12234  df-2 12303  df-3 12304  df-n0 12505  df-z 12592  df-uz 12863  df-rp 13017  df-ico 13378  df-fz 13536  df-fzo 13683  df-fl 13825  df-seq 14038  df-exp 14098  df-fac 14310  df-bc 14339  df-hash 14367  df-shft 15104  df-cj 15150  df-re 15151  df-im 15152  df-sqrt 15286  df-abs 15287  df-limsup 15522  df-clim 15539  df-rlim 15540  df-sum 15738  df-ef 16121
This theorem is referenced by:  efzval  16158  efgt0  16159  tanval3  16190  demoivre  16256  ef2kpi  26609  efif1olem4  26676  explog  26725  reexplog  26726  relogexp  26727  tanarg  26750  root1eq1  26886  cos9thpiminplylem3  34119  cos9thpiminplylem5  34121  vtsprod  34971
  Copyright terms: Public domain W3C validator