ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  expnegap0 Unicode version

Theorem expnegap0 10618
Description: Value of a complex number raised to a negative integer power. (Contributed by Jim Kingdon, 8-Jun-2020.)
Assertion
Ref Expression
expnegap0  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e. 
NN0 )  ->  ( A ^ -u N )  =  ( 1  / 
( A ^ N
) ) )

Proof of Theorem expnegap0
StepHypRef Expression
1 elnn0 9242 . . 3  |-  ( N  e.  NN0  <->  ( N  e.  NN  \/  N  =  0 ) )
2 nnne0 9010 . . . . . . . . . 10  |-  ( N  e.  NN  ->  N  =/=  0 )
32adantl 277 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  =/=  0 )
4 nncn 8990 . . . . . . . . . . . 12  |-  ( N  e.  NN  ->  N  e.  CC )
54adantl 277 . . . . . . . . . . 11  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  CC )
65negeq0d 8322 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( N  =  0  <->  -u N  =  0
) )
76necon3abid 2403 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( N  =/=  0  <->  -.  -u N  =  0
) )
83, 7mpbid 147 . . . . . . . 8  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  -.  -u N  =  0 )
98iffalsed 3567 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  if ( -u N  =  0 ,  1 ,  if ( 0  <  -u N ,  (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 -u N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) ) ) )  =  if ( 0  <  -u N ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  -u N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) ) ) )
10 nnnn0 9247 . . . . . . . . . . 11  |-  ( N  e.  NN  ->  N  e.  NN0 )
1110adantl 277 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  NN0 )
12 nn0nlt0 9266 . . . . . . . . . 10  |-  ( N  e.  NN0  ->  -.  N  <  0 )
1311, 12syl 14 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  -.  N  <  0
)
1411nn0red 9294 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  RR )
1514lt0neg1d 8534 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( N  <  0  <->  0  <  -u N ) )
1613, 15mtbid 673 . . . . . . . 8  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  -.  0  <  -u N
)
1716iffalsed 3567 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  if ( 0  <  -u N ,  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) ) )  =  ( 1  / 
(  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 -u -u N ) ) )
185negnegd 8321 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  -> 
-u -u N  =  N )
1918fveq2d 5558 . . . . . . . 8  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  -u -u N
)  =  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N ) )
2019oveq2d 5934 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) )  =  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N ) ) )
219, 17, 203eqtrd 2230 . . . . . 6  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  if ( -u N  =  0 ,  1 ,  if ( 0  <  -u N ,  (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 -u N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) ) ) )  =  ( 1  /  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  N ) ) )
2221adantlr 477 . . . . 5  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  N  e.  NN )  ->  if ( -u N  =  0 ,  1 ,  if ( 0  <  -u N ,  (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 -u N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) ) ) )  =  ( 1  /  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  N ) ) )
23 simp1 999 . . . . . . 7  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  A  e.  CC )
24 simp3 1001 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  N  e.  NN )
2524nnzd 9438 . . . . . . . 8  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  N  e.  ZZ )
2625znegcld 9441 . . . . . . 7  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  -u N  e.  ZZ )
27 simp2 1000 . . . . . . . 8  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  A #  0 )
2827orcd 734 . . . . . . 7  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  ( A #  0  \/  0  <_ 
-u N ) )
29 exp3val 10612 . . . . . . 7  |-  ( ( A  e.  CC  /\  -u N  e.  ZZ  /\  ( A #  0  \/  0  <_  -u N ) )  ->  ( A ^ -u N )  =  if ( -u N  =  0 ,  1 ,  if ( 0  <  -u N ,  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) ) ) ) )
3023, 26, 28, 29syl3anc 1249 . . . . . 6  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  ( A ^ -u N )  =  if ( -u N  =  0 , 
1 ,  if ( 0  <  -u N ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  -u N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) ) ) ) )
31303expa 1205 . . . . 5  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  N  e.  NN )  ->  ( A ^ -u N
)  =  if (
-u N  =  0 ,  1 ,  if ( 0  <  -u N ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  -u N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u -u N ) ) ) ) )
32 expnnval 10613 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( A ^ N
)  =  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N ) )
3332oveq2d 5934 . . . . . 6  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( 1  /  ( A ^ N ) )  =  ( 1  / 
(  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N ) ) )
3433adantlr 477 . . . . 5  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  N  e.  NN )  ->  ( 1  /  ( A ^ N ) )  =  ( 1  / 
(  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N ) ) )
3522, 31, 343eqtr4d 2236 . . . 4  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  N  e.  NN )  ->  ( A ^ -u N
)  =  ( 1  /  ( A ^ N ) ) )
36 1div1e1 8723 . . . . . . 7  |-  ( 1  /  1 )  =  1
3736eqcomi 2197 . . . . . 6  |-  1  =  ( 1  / 
1 )
38 negeq 8212 . . . . . . . . 9  |-  ( N  =  0  ->  -u N  =  -u 0 )
39 neg0 8265 . . . . . . . . 9  |-  -u 0  =  0
4038, 39eqtrdi 2242 . . . . . . . 8  |-  ( N  =  0  ->  -u N  =  0 )
4140oveq2d 5934 . . . . . . 7  |-  ( N  =  0  ->  ( A ^ -u N )  =  ( A ^
0 ) )
42 exp0 10614 . . . . . . 7  |-  ( A  e.  CC  ->  ( A ^ 0 )  =  1 )
4341, 42sylan9eqr 2248 . . . . . 6  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^ -u N )  =  1 )
44 oveq2 5926 . . . . . . . 8  |-  ( N  =  0  ->  ( A ^ N )  =  ( A ^ 0 ) )
4544, 42sylan9eqr 2248 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^ N )  =  1 )
4645oveq2d 5934 . . . . . 6  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( 1  / 
( A ^ N
) )  =  ( 1  /  1 ) )
4737, 43, 463eqtr4a 2252 . . . . 5  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^ -u N )  =  ( 1  /  ( A ^ N ) ) )
4847adantlr 477 . . . 4  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  N  =  0 )  ->  ( A ^ -u N )  =  ( 1  /  ( A ^ N ) ) )
4935, 48jaodan 798 . . 3  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  ( N  e.  NN  \/  N  =  0
) )  ->  ( A ^ -u N )  =  ( 1  / 
( A ^ N
) ) )
501, 49sylan2b 287 . 2  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  N  e.  NN0 )  -> 
( A ^ -u N
)  =  ( 1  /  ( A ^ N ) ) )
51503impa 1196 1  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e. 
NN0 )  ->  ( A ^ -u N )  =  ( 1  / 
( A ^ N
) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 709    /\ w3a 980    = wceq 1364    e. wcel 2164    =/= wne 2364   ifcif 3557   {csn 3618   class class class wbr 4029    X. cxp 4657   ` cfv 5254  (class class class)co 5918   CCcc 7870   0cc0 7872   1c1 7873    x. cmul 7877    < clt 8054    <_ cle 8055   -ucneg 8191   # cap 8600    / cdiv 8691   NNcn 8982   NN0cn0 9240   ZZcz 9317    seqcseq 10518   ^cexp 10609
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-po 4327  df-iso 4328  df-iord 4397  df-on 4399  df-ilim 4400  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-frec 6444  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601  df-div 8692  df-inn 8983  df-n0 9241  df-z 9318  df-uz 9593  df-seqfrec 10519  df-exp 10610
This theorem is referenced by:  expineg2  10619  expn1ap0  10620  expnegzap  10644  efexp  11825  pcexp  12447  ex-exp  15219
  Copyright terms: Public domain W3C validator