ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  expnegzap Unicode version
Theorem expnegzap 10573
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 9287 . . 3 |- ( N e. ZZ <-> ( N e. RR /\ ( N e. NN0 \/ -u N e. NN0 ) ) )
2 expnegap0 10547 . . . . . . 7 |- ( ( A e. CC /\ A # 0 /\ N e. NN0 ) -> ( A ^ -u N ) = ( 1 / ( A ^ N ) ) )
323expia 1207 . . . . . 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 8005 . . . . . . . . 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 10548 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. CC /\ -u N e. NN0 ) ) -> ( A ^ N ) = ( 1 / ( A ^ -u N ) ) )
105, 7, 8, 9syl12anc 1247 . . . . . . . 8 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( A ^ N ) = ( 1 / ( A ^ -u N ) ) )
1110oveq2d 5907 . . . . . . 7 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( 1 / ( A ^ N ) ) = ( 1 / ( 1 / ( A ^ -u N ) ) ) )
12 expcl 10557 . . . . . . . . 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 9392 . . . . . . . . 9 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> -u N e. ZZ )
17 expap0i 10571 . . . . . . . . 9 |- ( ( A e. CC /\ A # 0 /\ -u N e. ZZ ) -> ( A ^ -u N ) # 0 )
1814, 15, 16, 17syl3anc 1249 . . . . . . . 8 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( A ^ -u N ) # 0 )
1913, 18recrecapd 8761 . . . . . . 7 |- ( ( ( A e. CC /\ A # 0 ) /\ ( N e. RR /\ -u N e. NN0 ) ) -> ( 1 / ( 1 / ( A ^ -u N ) ) ) = ( A ^ -u N ) )
2011, 19eqtr2d 2223 . . . . . 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 1202 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 980   = wceq 1364   e. wcel 2160   class class class wbr 4018  (class class class)co 5891   CCcc 7828   RRcr 7829   0cc0 7830   1c1 7831   -ucneg 8148   # cap 8557   / cdiv 8648   NN0cn0 9195   ZZcz 9272   ^cexp 10538
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 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-nul 4144  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551  ax-iinf 4602  ax-cnex 7921  ax-resscn 7922  ax-1cn 7923  ax-1re 7924  ax-icn 7925  ax-addcl 7926  ax-addrcl 7927  ax-mulcl 7928  ax-mulrcl 7929  ax-addcom 7930  ax-mulcom 7931  ax-addass 7932  ax-mulass 7933  ax-distr 7934  ax-i2m1 7935  ax-0lt1 7936  ax-1rid 7937  ax-0id 7938  ax-rnegex 7939  ax-precex 7940  ax-cnre 7941  ax-pre-ltirr 7942  ax-pre-ltwlin 7943  ax-pre-lttrn 7944  ax-pre-apti 7945  ax-pre-ltadd 7946  ax-pre-mulgt0 7947  ax-pre-mulext 7948
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 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-if 3550  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-id 4308  df-po 4311  df-iso 4312  df-iord 4381  df-on 4383  df-ilim 4384  df-suc 4386  df-iom 4605  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-ima 4654  df-iota 5193  df-fun 5233  df-fn 5234  df-f 5235  df-f1 5236  df-fo 5237  df-f1o 5238  df-fv 5239  df-riota 5847  df-ov 5894  df-oprab 5895  df-mpo 5896  df-1st 6159  df-2nd 6160  df-recs 6324  df-frec 6410  df-pnf 8013  df-mnf 8014  df-xr 8015  df-ltxr 8016  df-le 8017  df-sub 8149  df-neg 8150  df-reap 8551  df-ap 8558  df-div 8649  df-inn 8939  df-n0 9196  df-z 9273  df-uz 9548  df-seqfrec 10465  df-exp 10539
This theorem is referenced by:  expsubap  10587  expnegapd  10680
  Copyright terms: Public domain W3C validator