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

Theorem expnegap0 10810
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 9404 . . 3  |-  ( N  e.  NN0  <->  ( N  e.  NN  \/  N  =  0 ) )
2 nnne0 9171 . . . . . . . . . 10  |-  ( N  e.  NN  ->  N  =/=  0 )
32adantl 277 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  =/=  0 )
4 nncn 9151 . . . . . . . . . . . 12  |-  ( N  e.  NN  ->  N  e.  CC )
54adantl 277 . . . . . . . . . . 11  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  CC )
65negeq0d 8482 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( N  =  0  <->  -u N  =  0
) )
76necon3abid 2441 . . . . . . . . 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 3615 . . . . . . 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 9409 . . . . . . . . . . 11  |-  ( N  e.  NN  ->  N  e.  NN0 )
1110adantl 277 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  NN0 )
12 nn0nlt0 9428 . . . . . . . . . 10  |-  ( N  e.  NN0  ->  -.  N  <  0 )
1311, 12syl 14 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  -.  N  <  0
)
1411nn0red 9456 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  RR )
1514lt0neg1d 8695 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( N  <  0  <->  0  <  -u N ) )
1613, 15mtbid 678 . . . . . . . 8  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  -.  0  <  -u N
)
1716iffalsed 3615 . . . . . . 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 8481 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  -> 
-u -u N  =  N )
1918fveq2d 5643 . . . . . . . 8  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  -u -u N
)  =  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N ) )
2019oveq2d 6034 . . . . . . 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 2268 . . . . . 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 1023 . . . . . . 7  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  A  e.  CC )
24 simp3 1025 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  N  e.  NN )
2524nnzd 9601 . . . . . . . 8  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  N  e.  ZZ )
2625znegcld 9604 . . . . . . 7  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  -u N  e.  ZZ )
27 simp2 1024 . . . . . . . 8  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  A #  0 )
2827orcd 740 . . . . . . 7  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  ( A #  0  \/  0  <_ 
-u N ) )
29 exp3val 10804 . . . . . . 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 1273 . . . . . 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 1229 . . . . 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 10805 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( A ^ N
)  =  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N ) )
3332oveq2d 6034 . . . . . 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 2274 . . . 4  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  N  e.  NN )  ->  ( A ^ -u N
)  =  ( 1  /  ( A ^ N ) ) )
36 1div1e1 8884 . . . . . . 7  |-  ( 1  /  1 )  =  1
3736eqcomi 2235 . . . . . 6  |-  1  =  ( 1  / 
1 )
38 negeq 8372 . . . . . . . . 9  |-  ( N  =  0  ->  -u N  =  -u 0 )
39 neg0 8425 . . . . . . . . 9  |-  -u 0  =  0
4038, 39eqtrdi 2280 . . . . . . . 8  |-  ( N  =  0  ->  -u N  =  0 )
4140oveq2d 6034 . . . . . . 7  |-  ( N  =  0  ->  ( A ^ -u N )  =  ( A ^
0 ) )
42 exp0 10806 . . . . . . 7  |-  ( A  e.  CC  ->  ( A ^ 0 )  =  1 )
4341, 42sylan9eqr 2286 . . . . . 6  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^ -u N )  =  1 )
44 oveq2 6026 . . . . . . . 8  |-  ( N  =  0  ->  ( A ^ N )  =  ( A ^ 0 ) )
4544, 42sylan9eqr 2286 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^ N )  =  1 )
4645oveq2d 6034 . . . . . 6  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( 1  / 
( A ^ N
) )  =  ( 1  /  1 ) )
4737, 43, 463eqtr4a 2290 . . . . 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 804 . . 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 1220 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 715    /\ w3a 1004    = wceq 1397    e. wcel 2202    =/= wne 2402   ifcif 3605   {csn 3669   class class class wbr 4088    X. cxp 4723   ` cfv 5326  (class class class)co 6018   CCcc 8030   0cc0 8032   1c1 8033    x. cmul 8037    < clt 8214    <_ cle 8215   -ucneg 8351   # cap 8761    / cdiv 8852   NNcn 9143   NN0cn0 9402   ZZcz 9479    seqcseq 10710   ^cexp 10801
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-frec 6557  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-div 8853  df-inn 9144  df-n0 9403  df-z 9480  df-uz 9756  df-seqfrec 10711  df-exp 10802
This theorem is referenced by:  expineg2  10811  expn1ap0  10812  expnegzap  10836  efexp  12261  pcexp  12900  ex-exp  16370
  Copyright terms: Public domain W3C validator