ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  expp1 Unicode version
Theorem expp1 10932
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 9515 . 2 |- ( N e. NN0 <-> ( N e. NN \/ N = 0 ) )
2 simpr 110 . . . . . . 7 |- ( ( A e. CC /\ N e. NN ) -> N e. NN )
3 elnnuz 9909 . . . . . . 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 9909 . . . . . . . . 9 |- ( x e. NN <-> x e. ( ZZ>= ` 1 ) )
7 fvconst2g 5903 . . . . . . . . . 10 |- ( ( A e. CC /\ x e. NN ) -> ( ( NN X. { A } ) ` x ) = A )
87eleq1d 2303 . . . . . . . . 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 8270 . . . . . . 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 10851 . . . . 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 9266 . . . . . . 7 |- ( N e. NN -> ( N + 1 ) e. NN )
16 fvconst2g 5903 . . . . . . 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 6074 . . . . 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 2267 . . . 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 10928 . . . . 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 10928 . . . . 5 |- ( ( A e. CC /\ N e. NN ) -> ( A ^ N ) = ( seq 1 ( x. , ( NN X. { A } ) ) ` N ) )
2322oveq1d 6073 . . . 4 |- ( ( A e. CC /\ N e. NN ) -> ( ( A ^ N ) x. A ) = ( ( seq 1 ( x. , ( NN X. { A } ) ) ` N ) x. A ) )
2419, 21, 233eqtr4d 2277 . . 3 |- ( ( A e. CC /\ N e. NN ) -> ( A ^ ( N + 1 ) ) = ( ( A ^ N ) x. A ) )
25 exp1 10931 . . . . . 6 |- ( A e. CC -> ( A ^ 1 ) = A )
26 mullid 8288 . . . . . 6 |- ( A e. CC -> ( 1 x. A ) = A )
2725, 26eqtr4d 2270 . . . . 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 6073 . . . . . 6 |- ( ( A e. CC /\ N = 0 ) -> ( N + 1 ) = ( 0 + 1 ) )
31 0p1e1 9368 . . . . . 6 |- ( 0 + 1 ) = 1
3230, 31eqtrdi 2283 . . . . 5 |- ( ( A e. CC /\ N = 0 ) -> ( N + 1 ) = 1 )
3332oveq2d 6074 . . . 4 |- ( ( A e. CC /\ N = 0 ) -> ( A ^ ( N + 1 ) ) = ( A ^ 1 ) )
34 oveq2 6066 . . . . . 6 |- ( N = 0 -> ( A ^ N ) = ( A ^ 0 ) )
35 exp0 10929 . . . . . 6 |- ( A e. CC -> ( A ^ 0 ) = 1 )
3634, 35sylan9eqr 2289 . . . . 5 |- ( ( A e. CC /\ N = 0 ) -> ( A ^ N ) = 1 )
3736oveq1d 6073 . . . 4 |- ( ( A e. CC /\ N = 0 ) -> ( ( A ^ N ) x. A ) = ( 1 x. A ) )
3828, 33, 373eqtr4d 2277 . . 3 |- ( ( A e. CC /\ N = 0 ) -> ( A ^ ( N + 1 ) ) = ( ( A ^ N ) x. A ) )
3924, 38jaodan 805 . 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 716   = wceq 1398   e. wcel 2205   {csn 3694   X. cxp 4752   ` cfv 5357  (class class class)co 6058   CCcc 8141   0cc0 8143   1c1 8144   + caddc 8146   x. cmul 8148   NNcn 9254   NN0cn0 9513   ZZ>=cuz 9871   seqcseq 10833   ^cexp 10924
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-seqfrec 10834  df-exp 10925
This theorem is referenced by:  expcllem  10936  expm1t  10953  expap0  10955  mulexp  10964  expadd  10967  expmul  10970  leexp2r  10979  leexp1a  10980  sqval  10983  cu2  11024  i3  11027  binom3  11043  bernneq  11047  modqexp  11053  expp1d  11061  faclbnd  11128  faclbnd2  11129  faclbnd6  11131  cjexp  11603  absexp  11789  binomlem  12194  geolim  12222  geo2sum  12225  efexp  12393  demoivreALT  12485  prmdvdsexp  12870  oddpwdclemodd  12894  pcexp  13032  numexpp1  13147  2exp7  13157  cnfldexp  14851  expcn  15560  expcncf  15600  dvexp  15702  tangtx  15829  rpcxpmul2  15904  binom4  15970  perfectlem1  15993  perfectlem2  15994
  Copyright terms: Public domain W3C validator