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

Theorem ef4p 12486
Description: Separate out the first four terms of the infinite series expansion of the exponential function. (Contributed by Paul Chapman, 19-Jan-2008.) (Revised by Mario Carneiro, 29-Apr-2014.)
Hypothesis
Ref Expression
ef4p.1  |-  F  =  ( n  e.  NN0  |->  ( ( A ^
n )  /  ( ! `  n )
) )
Assertion
Ref Expression
ef4p  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( ( ( ( 1  +  A )  +  ( ( A ^ 2 )  / 
2 ) )  +  ( ( A ^
3 )  /  6
) )  +  sum_ k  e.  ( ZZ>= ` 
4 ) ( F `
 k ) ) )
Distinct variable groups:    k, n, A   
k, F
Allowed substitution hint:    F( n)

Proof of Theorem ef4p
StepHypRef Expression
1 ef4p.1 . 2  |-  F  =  ( n  e.  NN0  |->  ( ( A ^
n )  /  ( ! `  n )
) )
2 df-4 9374 . 2  |-  4  =  ( 3  +  1 )
3 3nn0 9592 . 2  |-  3  e.  NN0
4 id 19 . 2  |-  ( A  e.  CC  ->  A  e.  CC )
5 ax-1cn 8278 . . . 4  |-  1  e.  CC
6 addcl 8310 . . . 4  |-  ( ( 1  e.  CC  /\  A  e.  CC )  ->  ( 1  +  A
)  e.  CC )
75, 6mpan 428 . . 3  |-  ( A  e.  CC  ->  (
1  +  A )  e.  CC )
8 sqcl 11058 . . . 4  |-  ( A  e.  CC  ->  ( A ^ 2 )  e.  CC )
98halfcld 9561 . . 3  |-  ( A  e.  CC  ->  (
( A ^ 2 )  /  2 )  e.  CC )
107, 9addcld 8351 . 2  |-  ( A  e.  CC  ->  (
( 1  +  A
)  +  ( ( A ^ 2 )  /  2 ) )  e.  CC )
11 df-3 9373 . . 3  |-  3  =  ( 2  +  1 )
12 2nn0 9591 . . 3  |-  2  e.  NN0
13 df-2 9372 . . . 4  |-  2  =  ( 1  +  1 )
14 1nn0 9590 . . . 4  |-  1  e.  NN0
155a1i 9 . . . 4  |-  ( A  e.  CC  ->  1  e.  CC )
16 1e0p1 9834 . . . . 5  |-  1  =  ( 0  +  1 )
17 0nn0 9589 . . . . 5  |-  0  e.  NN0
18 0cnd 8325 . . . . 5  |-  ( A  e.  CC  ->  0  e.  CC )
191efval2 12457 . . . . . . . 8  |-  ( A  e.  CC  ->  ( exp `  A )  = 
sum_ k  e.  NN0  ( F `  k ) )
20 nn0uz 9973 . . . . . . . . 9  |-  NN0  =  ( ZZ>= `  0 )
2120sumeq1i 12154 . . . . . . . 8  |-  sum_ k  e.  NN0  ( F `  k )  =  sum_ k  e.  ( ZZ>= ` 
0 ) ( F `
 k )
2219, 21eqtr2di 2288 . . . . . . 7  |-  ( A  e.  CC  ->  sum_ k  e.  ( ZZ>= `  0 )
( F `  k
)  =  ( exp `  A ) )
2322oveq2d 6104 . . . . . 6  |-  ( A  e.  CC  ->  (
0  +  sum_ k  e.  ( ZZ>= `  0 )
( F `  k
) )  =  ( 0  +  ( exp `  A ) ) )
24 efcl 12456 . . . . . . 7  |-  ( A  e.  CC  ->  ( exp `  A )  e.  CC )
2524addlidd 8483 . . . . . 6  |-  ( A  e.  CC  ->  (
0  +  ( exp `  A ) )  =  ( exp `  A
) )
2623, 25eqtr2d 2272 . . . . 5  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( 0  +  sum_ k  e.  ( ZZ>= ` 
0 ) ( F `
 k ) ) )
27 eft0val 12485 . . . . . . 7  |-  ( A  e.  CC  ->  (
( A ^ 0 )  /  ( ! `
 0 ) )  =  1 )
2827oveq2d 6104 . . . . . 6  |-  ( A  e.  CC  ->  (
0  +  ( ( A ^ 0 )  /  ( ! ` 
0 ) ) )  =  ( 0  +  1 ) )
29 0p1e1 9427 . . . . . 6  |-  ( 0  +  1 )  =  1
3028, 29eqtrdi 2287 . . . . 5  |-  ( A  e.  CC  ->  (
0  +  ( ( A ^ 0 )  /  ( ! ` 
0 ) ) )  =  1 )
311, 16, 17, 4, 18, 26, 30efsep 12483 . . . 4  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( 1  +  sum_ k  e.  ( ZZ>= ` 
1 ) ( F `
 k ) ) )
32 exp1 11003 . . . . . . 7  |-  ( A  e.  CC  ->  ( A ^ 1 )  =  A )
33 fac1 11189 . . . . . . . 8  |-  ( ! `
 1 )  =  1
3433a1i 9 . . . . . . 7  |-  ( A  e.  CC  ->  ( ! `  1 )  =  1 )
3532, 34oveq12d 6106 . . . . . 6  |-  ( A  e.  CC  ->  (
( A ^ 1 )  /  ( ! `
 1 ) )  =  ( A  / 
1 ) )
36 div1 9041 . . . . . 6  |-  ( A  e.  CC  ->  ( A  /  1 )  =  A )
3735, 36eqtrd 2271 . . . . 5  |-  ( A  e.  CC  ->  (
( A ^ 1 )  /  ( ! `
 1 ) )  =  A )
3837oveq2d 6104 . . . 4  |-  ( A  e.  CC  ->  (
1  +  ( ( A ^ 1 )  /  ( ! ` 
1 ) ) )  =  ( 1  +  A ) )
391, 13, 14, 4, 15, 31, 38efsep 12483 . . 3  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( ( 1  +  A )  +  sum_ k  e.  ( ZZ>= ` 
2 ) ( F `
 k ) ) )
40 fac2 11191 . . . . . 6  |-  ( ! `
 2 )  =  2
4140oveq2i 6099 . . . . 5  |-  ( ( A ^ 2 )  /  ( ! ` 
2 ) )  =  ( ( A ^
2 )  /  2
)
4241oveq2i 6099 . . . 4  |-  ( ( 1  +  A )  +  ( ( A ^ 2 )  / 
( ! `  2
) ) )  =  ( ( 1  +  A )  +  ( ( A ^ 2 )  /  2 ) )
4342a1i 9 . . 3  |-  ( A  e.  CC  ->  (
( 1  +  A
)  +  ( ( A ^ 2 )  /  ( ! ` 
2 ) ) )  =  ( ( 1  +  A )  +  ( ( A ^
2 )  /  2
) ) )
441, 11, 12, 4, 7, 39, 43efsep 12483 . 2  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( ( ( 1  +  A )  +  ( ( A ^
2 )  /  2
) )  +  sum_ k  e.  ( ZZ>= ` 
3 ) ( F `
 k ) ) )
45 fac3 11192 . . . . 5  |-  ( ! `
 3 )  =  6
4645oveq2i 6099 . . . 4  |-  ( ( A ^ 3 )  /  ( ! ` 
3 ) )  =  ( ( A ^
3 )  /  6
)
4746oveq2i 6099 . . 3  |-  ( ( ( 1  +  A
)  +  ( ( A ^ 2 )  /  2 ) )  +  ( ( A ^ 3 )  / 
( ! `  3
) ) )  =  ( ( ( 1  +  A )  +  ( ( A ^
2 )  /  2
) )  +  ( ( A ^ 3 )  /  6 ) )
4847a1i 9 . 2  |-  ( A  e.  CC  ->  (
( ( 1  +  A )  +  ( ( A ^ 2 )  /  2 ) )  +  ( ( A ^ 3 )  /  ( ! ` 
3 ) ) )  =  ( ( ( 1  +  A )  +  ( ( A ^ 2 )  / 
2 ) )  +  ( ( A ^
3 )  /  6
) ) )
491, 2, 3, 4, 10, 44, 48efsep 12483 1  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( ( ( ( 1  +  A )  +  ( ( A ^ 2 )  / 
2 ) )  +  ( ( A ^
3 )  /  6
) )  +  sum_ k  e.  ( ZZ>= ` 
4 ) ( F `
 k ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209    |-> cmpt 4193   ` cfv 5380  (class class class)co 6088   CCcc 8183   0cc0 8185   1c1 8186    + caddc 8188    / cdiv 9010   2c2 9364   3c3 9365   4c4 9366   6c6 9368   NN0cn0 9574   ZZ>=cuz 9937   ^cexp 10996   !cfa 11185   sum_csu 12144   expce 12434
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-frec 6666  df-1o 6691  df-oadd 6695  df-er 6811  df-en 7027  df-dom 7028  df-fin 7029  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-5 9375  df-6 9376  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-ico 10313  df-fz 10429  df-fzo 10567  df-seqfrec 10906  df-exp 10997  df-fac 11186  df-ihash 11237  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-clim 12070  df-sumdc 12145  df-ef 12440
This theorem is used by:  efi4p  12509
  Copyright terms: Public domain W3C validator