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

Theorem expp1 10500
Description: Value of a complex number raised to a nonnegative integer power plus one. Part of Definition 10-4.1 of [Gleason] p. 134. (Contributed by NM, 20-May-2005.) (Revised by Mario Carneiro, 2-Jul-2013.)
Assertion
Ref Expression
expp1  |-  ( ( A  e.  CC  /\  N  e.  NN0 )  -> 
( A ^ ( N  +  1 ) )  =  ( ( A ^ N )  x.  A ) )

Proof of Theorem expp1
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elnn0 9154 . 2  |-  ( N  e.  NN0  <->  ( N  e.  NN  \/  N  =  0 ) )
2 simpr 110 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  NN )
3 elnnuz 9540 . . . . . . 7  |-  ( N  e.  NN  <->  N  e.  ( ZZ>= `  1 )
)
42, 3sylib 122 . . . . . 6  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  N  e.  ( ZZ>= ` 
1 ) )
5 simpll 527 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  N  e.  NN )  /\  x  e.  (
ZZ>= `  1 ) )  ->  A  e.  CC )
6 elnnuz 9540 . . . . . . . . 9  |-  ( x  e.  NN  <->  x  e.  ( ZZ>= `  1 )
)
7 fvconst2g 5725 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  x  e.  NN )  ->  ( ( NN  X.  { A } ) `  x )  =  A )
87eleq1d 2246 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  x  e.  NN )  ->  ( ( ( NN 
X.  { A }
) `  x )  e.  CC  <->  A  e.  CC ) )
96, 8sylan2br 288 . . . . . . . 8  |-  ( ( A  e.  CC  /\  x  e.  ( ZZ>= ` 
1 ) )  -> 
( ( ( NN 
X.  { A }
) `  x )  e.  CC  <->  A  e.  CC ) )
109adantlr 477 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  N  e.  NN )  /\  x  e.  (
ZZ>= `  1 ) )  ->  ( ( ( NN  X.  { A } ) `  x
)  e.  CC  <->  A  e.  CC ) )
115, 10mpbird 167 . . . . . 6  |-  ( ( ( A  e.  CC  /\  N  e.  NN )  /\  x  e.  (
ZZ>= `  1 ) )  ->  ( ( NN 
X.  { A }
) `  x )  e.  CC )
12 mulcl 7916 . . . . . . 7  |-  ( ( x  e.  CC  /\  y  e.  CC )  ->  ( x  x.  y
)  e.  CC )
1312adantl 277 . . . . . 6  |-  ( ( ( A  e.  CC  /\  N  e.  NN )  /\  ( x  e.  CC  /\  y  e.  CC ) )  -> 
( x  x.  y
)  e.  CC )
144, 11, 13seq3p1 10435 . . . . 5  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  ( N  +  1 ) )  =  ( (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N )  x.  ( ( NN  X.  { A } ) `  ( N  +  1
) ) ) )
15 peano2nn 8907 . . . . . . 7  |-  ( N  e.  NN  ->  ( N  +  1 )  e.  NN )
16 fvconst2g 5725 . . . . . . 7  |-  ( ( A  e.  CC  /\  ( N  +  1
)  e.  NN )  ->  ( ( NN 
X.  { A }
) `  ( N  +  1 ) )  =  A )
1715, 16sylan2 286 . . . . . 6  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( ( NN  X.  { A } ) `  ( N  +  1
) )  =  A )
1817oveq2d 5884 . . . . 5  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  N )  x.  (
( NN  X.  { A } ) `  ( N  +  1 ) ) )  =  ( (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  N
)  x.  A ) )
1914, 18eqtrd 2210 . . . 4  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  ( N  +  1 ) )  =  ( (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N )  x.  A ) )
20 expnnval 10496 . . . . 5  |-  ( ( A  e.  CC  /\  ( N  +  1
)  e.  NN )  ->  ( A ^
( N  +  1 ) )  =  (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 ( N  + 
1 ) ) )
2115, 20sylan2 286 . . . 4  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( A ^ ( N  +  1 ) )  =  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  ( N  +  1
) ) )
22 expnnval 10496 . . . . 5  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( A ^ N
)  =  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N ) )
2322oveq1d 5883 . . . 4  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( ( A ^ N )  x.  A
)  =  ( (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N )  x.  A ) )
2419, 21, 233eqtr4d 2220 . . 3  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( A ^ ( N  +  1 ) )  =  ( ( A ^ N )  x.  A ) )
25 exp1 10499 . . . . . 6  |-  ( A  e.  CC  ->  ( A ^ 1 )  =  A )
26 mulid2 7933 . . . . . 6  |-  ( A  e.  CC  ->  (
1  x.  A )  =  A )
2725, 26eqtr4d 2213 . . . . 5  |-  ( A  e.  CC  ->  ( A ^ 1 )  =  ( 1  x.  A
) )
2827adantr 276 . . . 4  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^
1 )  =  ( 1  x.  A ) )
29 simpr 110 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  N  =  0 )
3029oveq1d 5883 . . . . . 6  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( N  + 
1 )  =  ( 0  +  1 ) )
31 0p1e1 9009 . . . . . 6  |-  ( 0  +  1 )  =  1
3230, 31eqtrdi 2226 . . . . 5  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( N  + 
1 )  =  1 )
3332oveq2d 5884 . . . 4  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^
( N  +  1 ) )  =  ( A ^ 1 ) )
34 oveq2 5876 . . . . . 6  |-  ( N  =  0  ->  ( A ^ N )  =  ( A ^ 0 ) )
35 exp0 10497 . . . . . 6  |-  ( A  e.  CC  ->  ( A ^ 0 )  =  1 )
3634, 35sylan9eqr 2232 . . . . 5  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^ N )  =  1 )
3736oveq1d 5883 . . . 4  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( ( A ^ N )  x.  A )  =  ( 1  x.  A ) )
3828, 33, 373eqtr4d 2220 . . 3  |-  ( ( A  e.  CC  /\  N  =  0 )  ->  ( A ^
( N  +  1 ) )  =  ( ( A ^ N
)  x.  A ) )
3924, 38jaodan 797 . 2  |-  ( ( A  e.  CC  /\  ( N  e.  NN  \/  N  =  0
) )  ->  ( A ^ ( N  + 
1 ) )  =  ( ( A ^ N )  x.  A
) )
401, 39sylan2b 287 1  |-  ( ( A  e.  CC  /\  N  e.  NN0 )  -> 
( A ^ ( N  +  1 ) )  =  ( ( A ^ N )  x.  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 708    = wceq 1353    e. wcel 2148   {csn 3591    X. cxp 4620   ` cfv 5211  (class class class)co 5868   CCcc 7787   0cc0 7789   1c1 7790    + caddc 7792    x. cmul 7794   NNcn 8895   NN0cn0 9152   ZZ>=cuz 9504    seqcseq 10418   ^cexp 10492
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4205  ax-un 4429  ax-setind 4532  ax-iinf 4583  ax-cnex 7880  ax-resscn 7881  ax-1cn 7882  ax-1re 7883  ax-icn 7884  ax-addcl 7885  ax-addrcl 7886  ax-mulcl 7887  ax-mulrcl 7888  ax-addcom 7889  ax-mulcom 7890  ax-addass 7891  ax-mulass 7892  ax-distr 7893  ax-i2m1 7894  ax-0lt1 7895  ax-1rid 7896  ax-0id 7897  ax-rnegex 7898  ax-precex 7899  ax-cnre 7900  ax-pre-ltirr 7901  ax-pre-ltwlin 7902  ax-pre-lttrn 7903  ax-pre-apti 7904  ax-pre-ltadd 7905  ax-pre-mulgt0 7906  ax-pre-mulext 7907
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4289  df-po 4292  df-iso 4293  df-iord 4362  df-on 4364  df-ilim 4365  df-suc 4367  df-iom 4586  df-xp 4628  df-rel 4629  df-cnv 4630  df-co 4631  df-dm 4632  df-rn 4633  df-res 4634  df-ima 4635  df-iota 5173  df-fun 5213  df-fn 5214  df-f 5215  df-f1 5216  df-fo 5217  df-f1o 5218  df-fv 5219  df-riota 5824  df-ov 5871  df-oprab 5872  df-mpo 5873  df-1st 6134  df-2nd 6135  df-recs 6299  df-frec 6385  df-pnf 7971  df-mnf 7972  df-xr 7973  df-ltxr 7974  df-le 7975  df-sub 8107  df-neg 8108  df-reap 8509  df-ap 8516  df-div 8606  df-inn 8896  df-n0 9153  df-z 9230  df-uz 9505  df-seqfrec 10419  df-exp 10493
This theorem is referenced by:  expcllem  10504  expm1t  10521  expap0  10523  mulexp  10532  expadd  10535  expmul  10538  leexp2r  10547  leexp1a  10548  sqval  10551  cu2  10591  i3  10594  binom3  10610  bernneq  10613  modqexp  10619  expp1d  10627  faclbnd  10692  faclbnd2  10693  faclbnd6  10695  cjexp  10873  absexp  11059  binomlem  11462  geolim  11490  geo2sum  11493  efexp  11661  demoivreALT  11752  prmdvdsexp  12118  oddpwdclemodd  12142  pcexp  12279  expcncf  13725  dvexp  13808  tangtx  13892  binom4  14030
  Copyright terms: Public domain W3C validator