ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  expp1 Unicode version
Theorem expp1 10483
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 9137 . 2 |- ( N e. NN0 <-> ( N e. NN \/ N = 0 ) )
2 simpr 109 . . . . . . 7 |- ( ( A e. CC /\ N e. NN ) -> N e. NN )
3 elnnuz 9523 . . . . . . 7 |- ( N e. NN <-> N e. ( ZZ>= ` 1 ) )
42, 3sylib 121 . . . . . 6 |- ( ( A e. CC /\ N e. NN ) -> N e. ( ZZ>= ` 1 ) )
5 simpll 524 . . . . . . 7 |- ( ( ( A e. CC /\ N e. NN ) /\ x e. ( ZZ>= ` 1 ) ) -> A e. CC )
6 elnnuz 9523 . . . . . . . . 9 |- ( x e. NN <-> x e. ( ZZ>= ` 1 ) )
7 fvconst2g 5710 . . . . . . . . . 10 |- ( ( A e. CC /\ x e. NN ) -> ( ( NN X. { A } ) ` x ) = A )
87eleq1d 2239 . . . . . . . . 9 |- ( ( A e. CC /\ x e. NN ) -> ( ( ( NN X. { A } ) ` x ) e. CC <-> A e. CC ) )
96, 8sylan2br 286 . . . . . . . 8 |- ( ( A e. CC /\ x e. ( ZZ>= ` 1 ) ) -> ( ( ( NN X. { A } ) ` x ) e. CC <-> A e. CC ) )
109adantlr 474 . . . . . . 7 |- ( ( ( A e. CC /\ N e. NN ) /\ x e. ( ZZ>= ` 1 ) ) -> ( ( ( NN X. { A } ) ` x ) e. CC <-> A e. CC ) )
115, 10mpbird 166 . . . . . 6 |- ( ( ( A e. CC /\ N e. NN ) /\ x e. ( ZZ>= ` 1 ) ) -> ( ( NN X. { A } ) ` x ) e. CC )
12 mulcl 7901 . . . . . . 7 |- ( ( x e. CC /\ y e. CC ) -> ( x x. y ) e. CC )
1312adantl 275 . . . . . 6 |- ( ( ( A e. CC /\ N e. NN ) /\ ( x e. CC /\ y e. CC ) ) -> ( x x. y ) e. CC )
144, 11, 13seq3p1 10418 . . . . 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 8890 . . . . . . 7 |- ( N e. NN -> ( N + 1 ) e. NN )
16 fvconst2g 5710 . . . . . . 7 |- ( ( A e. CC /\ ( N + 1 ) e. NN ) -> ( ( NN X. { A } ) ` ( N + 1 ) ) = A )
1715, 16sylan2 284 . . . . . 6 |- ( ( A e. CC /\ N e. NN ) -> ( ( NN X. { A } ) ` ( N + 1 ) ) = A )
1817oveq2d 5869 . . . . 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 2203 . . . 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 10479 . . . . 5 |- ( ( A e. CC /\ ( N + 1 ) e. NN ) -> ( A ^ ( N + 1 ) ) = ( seq 1 ( x. , ( NN X. { A } ) ) ` ( N + 1 ) ) )
2115, 20sylan2 284 . . . 4 |- ( ( A e. CC /\ N e. NN ) -> ( A ^ ( N + 1 ) ) = ( seq 1 ( x. , ( NN X. { A } ) ) ` ( N + 1 ) ) )
22 expnnval 10479 . . . . 5 |- ( ( A e. CC /\ N e. NN ) -> ( A ^ N ) = ( seq 1 ( x. , ( NN X. { A } ) ) ` N ) )
2322oveq1d 5868 . . . 4 |- ( ( A e. CC /\ N e. NN ) -> ( ( A ^ N ) x. A ) = ( ( seq 1 ( x. , ( NN X. { A } ) ) ` N ) x. A ) )
2419, 21, 233eqtr4d 2213 . . 3 |- ( ( A e. CC /\ N e. NN ) -> ( A ^ ( N + 1 ) ) = ( ( A ^ N ) x. A ) )
25 exp1 10482 . . . . . 6 |- ( A e. CC -> ( A ^ 1 ) = A )
26 mulid2 7918 . . . . . 6 |- ( A e. CC -> ( 1 x. A ) = A )
2725, 26eqtr4d 2206 . . . . 5 |- ( A e. CC -> ( A ^ 1 ) = ( 1 x. A ) )
2827adantr 274 . . . 4 |- ( ( A e. CC /\ N = 0 ) -> ( A ^ 1 ) = ( 1 x. A ) )
29 simpr 109 . . . . . . 7 |- ( ( A e. CC /\ N = 0 ) -> N = 0 )
3029oveq1d 5868 . . . . . 6 |- ( ( A e. CC /\ N = 0 ) -> ( N + 1 ) = ( 0 + 1 ) )
31 0p1e1 8992 . . . . . 6 |- ( 0 + 1 ) = 1
3230, 31eqtrdi 2219 . . . . 5 |- ( ( A e. CC /\ N = 0 ) -> ( N + 1 ) = 1 )
3332oveq2d 5869 . . . 4 |- ( ( A e. CC /\ N = 0 ) -> ( A ^ ( N + 1 ) ) = ( A ^ 1 ) )
34 oveq2 5861 . . . . . 6 |- ( N = 0 -> ( A ^ N ) = ( A ^ 0 ) )
35 exp0 10480 . . . . . 6 |- ( A e. CC -> ( A ^ 0 ) = 1 )
3634, 35sylan9eqr 2225 . . . . 5 |- ( ( A e. CC /\ N = 0 ) -> ( A ^ N ) = 1 )
3736oveq1d 5868 . . . 4 |- ( ( A e. CC /\ N = 0 ) -> ( ( A ^ N ) x. A ) = ( 1 x. A ) )
3828, 33, 373eqtr4d 2213 . . 3 |- ( ( A e. CC /\ N = 0 ) -> ( A ^ ( N + 1 ) ) = ( ( A ^ N ) x. A ) )
3924, 38jaodan 792 . 2 |- ( ( A e. CC /\ ( N e. NN \/ N = 0 ) ) -> ( A ^ ( N + 1 ) ) = ( ( A ^ N ) x. A ) )
401, 39sylan2b 285 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 103   <-> wb 104   \/ wo 703   = wceq 1348   e. wcel 2141   {csn 3583   X. cxp 4609   ` cfv 5198  (class class class)co 5853   CCcc 7772   0cc0 7774   1c1 7775   + caddc 7777   x. cmul 7779   NNcn 8878   NN0cn0 9135   ZZ>=cuz 9487   seqcseq 10401   ^cexp 10475
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590  df-inn 8879  df-n0 9136  df-z 9213  df-uz 9488  df-seqfrec 10402  df-exp 10476
This theorem is referenced by:  expcllem  10487  expm1t  10504  expap0  10506  mulexp  10515  expadd  10518  expmul  10521  leexp2r  10530  leexp1a  10531  sqval  10534  cu2  10574  i3  10577  binom3  10593  bernneq  10596  modqexp  10602  expp1d  10610  faclbnd  10675  faclbnd2  10676  faclbnd6  10678  cjexp  10857  absexp  11043  binomlem  11446  geolim  11474  geo2sum  11477  efexp  11645  demoivreALT  11736  prmdvdsexp  12102  oddpwdclemodd  12126  pcexp  12263  expcncf  13386  dvexp  13469  tangtx  13553  binom4  13691
  Copyright terms: Public domain W3C validator