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

Theorem efexp 16153
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 12592 . . . 4 (𝑁 ∈ ℤ → 𝑁 ∈ ℂ)
2 mulcom 11182 . . . 4 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 · 𝑁) = (𝑁 · 𝐴))
31, 2sylan2 604 . . 3 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (𝐴 · 𝑁) = (𝑁 · 𝐴))
43fveq2d 6883 . 2 ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ) → (exp‘(𝐴 · 𝑁)) = (exp‘(𝑁 · 𝐴)))
5 oveq2 7416 . . . . . 6 (𝑗 = 0 → (𝐴 · 𝑗) = (𝐴 · 0))
65fveq2d 6883 . . . . 5 (𝑗 = 0 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 0)))
7 oveq2 7416 . . . . 5 (𝑗 = 0 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑0))
86, 7eqeq12d 2785 . . . 4 (𝑗 = 0 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 0)) = ((exp‘𝐴)↑0)))
9 oveq2 7416 . . . . . 6 (𝑗 = 𝑘 → (𝐴 · 𝑗) = (𝐴 · 𝑘))
109fveq2d 6883 . . . . 5 (𝑗 = 𝑘 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 𝑘)))
11 oveq2 7416 . . . . 5 (𝑗 = 𝑘 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑𝑘))
1210, 11eqeq12d 2785 . . . 4 (𝑗 = 𝑘 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)))
13 oveq2 7416 . . . . . 6 (𝑗 = (𝑘 + 1) → (𝐴 · 𝑗) = (𝐴 · (𝑘 + 1)))
1413fveq2d 6883 . . . . 5 (𝑗 = (𝑘 + 1) → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · (𝑘 + 1))))
15 oveq2 7416 . . . . 5 (𝑗 = (𝑘 + 1) → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑(𝑘 + 1)))
1614, 15eqeq12d 2785 . . . 4 (𝑗 = (𝑘 + 1) → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · (𝑘 + 1))) = ((exp‘𝐴)↑(𝑘 + 1))))
17 oveq2 7416 . . . . . 6 (𝑗 = -𝑘 → (𝐴 · 𝑗) = (𝐴 · -𝑘))
1817fveq2d 6883 . . . . 5 (𝑗 = -𝑘 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · -𝑘)))
19 oveq2 7416 . . . . 5 (𝑗 = -𝑘 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑-𝑘))
2018, 19eqeq12d 2785 . . . 4 (𝑗 = -𝑘 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · -𝑘)) = ((exp‘𝐴)↑-𝑘)))
21 oveq2 7416 . . . . . 6 (𝑗 = 𝑁 → (𝐴 · 𝑗) = (𝐴 · 𝑁))
2221fveq2d 6883 . . . . 5 (𝑗 = 𝑁 → (exp‘(𝐴 · 𝑗)) = (exp‘(𝐴 · 𝑁)))
23 oveq2 7416 . . . . 5 (𝑗 = 𝑁 → ((exp‘𝐴)↑𝑗) = ((exp‘𝐴)↑𝑁))
2422, 23eqeq12d 2785 . . . 4 (𝑗 = 𝑁 → ((exp‘(𝐴 · 𝑗)) = ((exp‘𝐴)↑𝑗) ↔ (exp‘(𝐴 · 𝑁)) = ((exp‘𝐴)↑𝑁)))
25 ef0 16141 . . . . 5 (exp‘0) = 1
26 mul01 11385 . . . . . 6 (𝐴 ∈ ℂ → (𝐴 · 0) = 0)
2726fveq2d 6883 . . . . 5 (𝐴 ∈ ℂ → (exp‘(𝐴 · 0)) = (exp‘0))
28 efcl 16132 . . . . . 6 (𝐴 ∈ ℂ → (exp‘𝐴) ∈ ℂ)
2928exp0d 14172 . . . . 5 (𝐴 ∈ ℂ → ((exp‘𝐴)↑0) = 1)
3025, 27, 293eqtr4a 2830 . . . 4 (𝐴 ∈ ℂ → (exp‘(𝐴 · 0)) = ((exp‘𝐴)↑0))
31 oveq1 7415 . . . . . . 7 ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
3231adantl 486 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘)) → ((exp‘(𝐴 · 𝑘)) · (exp‘𝐴)) = (((exp‘𝐴)↑𝑘) · (exp‘𝐴)))
33 nn0cn 12510 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
34 ax-1cn 11154 . . . . . . . . . . . 12 1 ∈ ℂ
35 adddi 11185 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + (𝐴 · 1)))
3634, 35mp3an3 1476 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + (𝐴 · 1)))
37 mulrid 11202 . . . . . . . . . . . . 13 (𝐴 ∈ ℂ → (𝐴 · 1) = 𝐴)
3837adantr 485 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · 1) = 𝐴)
3938oveq2d 7424 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → ((𝐴 · 𝑘) + (𝐴 · 1)) = ((𝐴 · 𝑘) + 𝐴))
4036, 39eqtrd 2804 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + 𝐴))
4133, 40sylan2 604 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴 · (𝑘 + 1)) = ((𝐴 · 𝑘) + 𝐴))
4241fveq2d 6883 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (exp‘(𝐴 · (𝑘 + 1))) = (exp‘((𝐴 · 𝑘) + 𝐴)))
43 mulcl 11180 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · 𝑘) ∈ ℂ)
4433, 43sylan2 604 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴 · 𝑘) ∈ ℂ)
45 simpl 487 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → 𝐴 ∈ ℂ)
46 efadd 16144 . . . . . . . . 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 14100 . . . . . . . 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 7416 . . . . . 6 ((exp‘(𝐴 · 𝑘)) = ((exp‘𝐴)↑𝑘) → (1 / (exp‘(𝐴 · 𝑘))) = (1 / ((exp‘𝐴)↑𝑘)))
56 nncn 12237 . . . . . . . . . 10 (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
57 mulneg2 11647 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 · -𝑘) = -(𝐴 · 𝑘))
5856, 57sylan2 604 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝐴 · -𝑘) = -(𝐴 · 𝑘))
5958fveq2d 6883 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘(𝐴 · -𝑘)) = (exp‘-(𝐴 · 𝑘)))
6056, 43sylan2 604 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝐴 · 𝑘) ∈ ℂ)
61 efneg 16150 . . . . . . . . 9 ((𝐴 · 𝑘) ∈ ℂ → (exp‘-(𝐴 · 𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
6260, 61syl 18 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘-(𝐴 · 𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
6359, 62eqtrd 2804 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (exp‘(𝐴 · -𝑘)) = (1 / (exp‘(𝐴 · 𝑘))))
64 nnnn0 12507 . . . . . . . 8 (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0)
65 expneg 14101 . . . . . . . 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 12693 . . 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 6533  (class class class)co 7408  cc 11094  0cc0 11096  1c1 11097   + caddc 11099   · cmul 11101  -cneg 11438   / cdiv 11867  cn 12229  0cn0 12500  cz 12587  cexp 14093  expce 16111
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 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-inf2 9606  ax-cnex 11152  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-mulcom 11160  ax-addass 11161  ax-mulass 11162  ax-distr 11163  ax-i2m1 11164  ax-1ne0 11165  ax-1rid 11166  ax-rnegex 11167  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170  ax-pre-lttrn 11171  ax-pre-ltadd 11172  ax-pre-mulgt0 11173  ax-pre-sup 11174
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 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-pm 8823  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-sup 9398  df-inf 9399  df-oi 9468  df-card 9921  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-sub 11439  df-neg 11440  df-div 11868  df-nn 12230  df-2 12299  df-3 12300  df-n0 12501  df-z 12588  df-uz 12859  df-rp 13013  df-ico 13374  df-fz 13532  df-fzo 13679  df-fl 13821  df-seq 14034  df-exp 14094  df-fac 14306  df-bc 14335  df-hash 14363  df-shft 15100  df-cj 15146  df-re 15147  df-im 15148  df-sqrt 15282  df-abs 15283  df-limsup 15518  df-clim 15535  df-rlim 15536  df-sum 15734  df-ef 16117
This theorem is referenced by:  efzval  16154  efgt0  16155  tanval3  16186  demoivre  16252  ef2kpi  26605  efif1olem4  26672  explog  26721  reexplog  26722  relogexp  26723  tanarg  26746  root1eq1  26882  cos9thpiminplylem3  34115  cos9thpiminplylem5  34117  vtsprod  34967
  Copyright terms: Public domain W3C validator