ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  expnegzap Unicode version
Theorem expnegzap 10567
Description: Value of a complex number raised to a negative power. (Contributed by Mario Carneiro, 4-Jun-2014.)
Assertion
Ref Expression
expnegzap |- ( ( A e. CC /\ A # 0 /\ N e. ZZ ) -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) )
Proof of Theorem expnegzap
StepHypRef Expression
1 elznn0 9281 . . 3 |- ( N e. ZZ <-> ( N e. RR /\ ( N e. NN0 \/ -u N e. NN0 ) ) )
2 expnegap0 10541 . . . . . . 7 |- ( ( A e. CC /\ A # 0 /\ N e. NN0 ) -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) )
323expia 1206 . . . . . 6 |- ( ( A e. CC /\ A # 0 ) -> ( N e. NN0 -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) ) )
43adantr 276 . . . . 5 |- ( ( ( A e. CC /\ A # 0 ) /\ N e. RR ) -> ( N e. NN0 -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) ) )
5 simpl 109 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( A e. CC /\ A # 0 ) )
6 simprl 529 . . . . . . . . . 10 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> N e. RR )
76recnd 7999 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> N e. CC )
8 simprr 531 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> -u N e. NN0 )
9 expineg2 10542 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. CC /\ -u N e. NN0 ) ) -> ( A ^ N ) = ( 1 / ( A ^ -u N ) ) )
105, 7, 8, 9syl12anc 1246 . . . . . . . 8 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( A ^ N ) = ( 1 / ( A ^ -u N ) ) )
1110oveq2d 5904 . . . . . . 7 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( 1 / ( A ^ N ) ) = ( 1 / ( 1 / ( A ^ -u N ) ) ) )
12 expcl 10551 . . . . . . . . 9 |- ( ( A e. CC /\ -u N e. NN0 ) -> ( A ^ -u N ) e. CC )
1312ad2ant2rl 511 . . . . . . . 8 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( A ^ -u N ) e. CC )
14 simpll 527 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> A e. CC )
15 simplr 528 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> A # 0 )
168nn0zd 9386 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> -u N e. ZZ )
17 expap0i 10565 . . . . . . . . 9 |- ( ( A e. CC /\ A # 0 /\ -u N e. ZZ ) -> ( A ^ -u N ) # 0 )
1814, 15, 16, 17syl3anc 1248 . . . . . . . 8 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( A ^ -u N ) # 0 )
1913, 18recrecapd 8755 . . . . . . 7 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( 1 / ( 1 / ( A ^ -u N ) ) ) = ( A ^ -u N ) )
2011, 19eqtr2d 2221 . . . . . 6 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) )
2120expr 375 . . . . 5 |- ( ( ( A e. CC /\ A # 0 ) /\ N e. RR ) -> ( -u N e. NN0 -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) ) )
224, 21jaod 718 . . . 4 |- ( ( ( A e. CC /\ A # 0 ) /\ N e. RR ) -> ( ( N e. NN0 \/ -u N e. NN0 ) -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) ) )
2322expimpd 363 . . 3 |- ( ( A e. CC /\ A # 0 ) -> ( ( N e. RR /\ ( N e. NN0 \/ -u N e. NN0 ) ) -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) ) )
241, 23biimtrid 152 . 2 |- ( ( A e. CC /\ A # 0 ) -> ( N e. ZZ -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) ) )
25243impia 1201 1 |- ( ( A e. CC /\ A # 0 /\ N e. ZZ ) -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   \/ wo 709   /\ w3a 979   = wceq 1363   e. wcel 2158   class class class wbr 4015  (class class class)co 5888   CCcc 7822   RRcr 7823   0cc0 7824   1c1 7825   -ucneg 8142   # cap 8551   / cdiv 8642   NN0cn0 9189   ZZcz 9266   ^cexp 10532
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 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-nul 4141  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-iinf 4599  ax-cnex 7915  ax-resscn 7916  ax-1cn 7917  ax-1re 7918  ax-icn 7919  ax-addcl 7920  ax-addrcl 7921  ax-mulcl 7922  ax-mulrcl 7923  ax-addcom 7924  ax-mulcom 7925  ax-addass 7926  ax-mulass 7927  ax-distr 7928  ax-i2m1 7929  ax-0lt1 7930  ax-1rid 7931  ax-0id 7932  ax-rnegex 7933  ax-precex 7934  ax-cnre 7935  ax-pre-ltirr 7936  ax-pre-ltwlin 7937  ax-pre-lttrn 7938  ax-pre-apti 7939  ax-pre-ltadd 7940  ax-pre-mulgt0 7941  ax-pre-mulext 7942
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rmo 2473  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-if 3547  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-id 4305  df-po 4308  df-iso 4309  df-iord 4378  df-on 4380  df-ilim 4381  df-suc 4383  df-iom 4602  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6154  df-2nd 6155  df-recs 6319  df-frec 6405  df-pnf 8007  df-mnf 8008  df-xr 8009  df-ltxr 8010  df-le 8011  df-sub 8143  df-neg 8144  df-reap 8545  df-ap 8552  df-div 8643  df-inn 8933  df-n0 9190  df-z 9267  df-uz 9542  df-seqfrec 10459  df-exp 10533
This theorem is referenced by:  expsubap  10581  expnegapd  10674
  Copyright terms: Public domain W3C validator