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

Theorem expnegap0 10639
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 9251 . . 3  |-  ( N  e.  NN0  <->  ( N  e.  NN  \/  N  =  0 ) )
2 nnne0 9018 . . . . . . . . . 10  |-  ( N  e.  NN  ->  N  =/=  0 )
32adantl 277 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  =/=  0 )
4 nncn 8998 . . . . . . . . . . . 12  |-  ( N  e.  NN  ->  N  e.  CC )
54adantl 277 . . . . . . . . . . 11  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  CC )
65negeq0d 8329 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( N  =  0  <->  -u N  =  0
) )
76necon3abid 2406 . . . . . . . . 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 3571 . . . . . . 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 9256 . . . . . . . . . . 11  |-  ( N  e.  NN  ->  N  e.  NN0 )
1110adantl 277 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  NN0 )
12 nn0nlt0 9275 . . . . . . . . . 10  |-  ( N  e.  NN0  ->  -.  N  <  0 )
1311, 12syl 14 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  -.  N  <  0
)
1411nn0red 9303 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  RR )
1514lt0neg1d 8542 . . . . . . . . 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 3571 . . . . . . 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 8328 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  N  e.  NN )  -> 
-u -u N  =  N )
1918fveq2d 5562 . . . . . . . 8  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  -u -u N
)  =  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N ) )
2019oveq2d 5938 . . . . . . 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 2233 . . . . . 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 9447 . . . . . . . 8  |-  ( ( A  e.  CC  /\  A #  0  /\  N  e.  NN )  ->  N  e.  ZZ )
2625znegcld 9450 . . . . . . 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 10633 . . . . . . 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 10634 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( A ^ N
)  =  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N ) )
3332oveq2d 5938 . . . . . 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 2239 . . . 4  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  N  e.  NN )  ->  ( A ^ -u N
)  =  ( 1  /  ( A ^ N ) ) )
36 1div1e1 8731 . . . . . . 7  |-  ( 1  /  1 )  =  1
3736eqcomi 2200 . . . . . 6  |-  1  =  ( 1  / 
1 )
38 negeq 8219 . . . . . . . . 9  |-  ( N  =  0  ->  -u N  =  -u 0 )
39 neg0 8272 . . . . . . . . 9  |-  -u 0  =  0
4038, 39eqtrdi 2245 . . . . . . . 8  |-  ( N  =  0  ->  -u N  =  0 )
4140oveq2d 5938 . . . . . . 7  |-  ( N  =  0  ->  ( A ^ -u N )  =  ( A ^
0 ) )
42 exp0 10635 . . . . . . 7  |-  ( A  e.  CC  ->  ( A ^ 0 )  =  1 )
4341, 42sylan9eqr 2251 . . . . . 6  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^ -u N )  =  1 )
44 oveq2 5930 . . . . . . . 8  |-  ( N  =  0  ->  ( A ^ N )  =  ( A ^ 0 ) )
4544, 42sylan9eqr 2251 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^ N )  =  1 )
4645oveq2d 5938 . . . . . 6  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( 1  / 
( A ^ N
) )  =  ( 1  /  1 ) )
4737, 43, 463eqtr4a 2255 . . . . 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 2167    =/= wne 2367   ifcif 3561   {csn 3622   class class class wbr 4033    X. cxp 4661   ` cfv 5258  (class class class)co 5922   CCcc 7877   0cc0 7879   1c1 7880    x. cmul 7884    < clt 8061    <_ cle 8062   -ucneg 8198   # cap 8608    / cdiv 8699   NNcn 8990   NN0cn0 9249   ZZcz 9326    seqcseq 10539   ^cexp 10630
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997
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 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-if 3562  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-ilim 4404  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-frec 6449  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-inn 8991  df-n0 9250  df-z 9327  df-uz 9602  df-seqfrec 10540  df-exp 10631
This theorem is referenced by:  expineg2  10640  expn1ap0  10641  expnegzap  10665  efexp  11847  pcexp  12478  ex-exp  15373
  Copyright terms: Public domain W3C validator