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

Theorem ef4p 12461
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 9365 . 2  |-  4  =  ( 3  +  1 )
3 3nn0 9581 . 2  |-  3  e.  NN0
4 id 19 . 2  |-  ( A  e.  CC  ->  A  e.  CC )
5 ax-1cn 8272 . . . 4  |-  1  e.  CC
6 addcl 8304 . . . 4  |-  ( ( 1  e.  CC  /\  A  e.  CC )  ->  ( 1  +  A
)  e.  CC )
75, 6mpan 428 . . 3  |-  ( A  e.  CC  ->  (
1  +  A )  e.  CC )
8 sqcl 11037 . . . 4  |-  ( A  e.  CC  ->  ( A ^ 2 )  e.  CC )
98halfcld 9550 . . 3  |-  ( A  e.  CC  ->  (
( A ^ 2 )  /  2 )  e.  CC )
107, 9addcld 8345 . 2  |-  ( A  e.  CC  ->  (
( 1  +  A
)  +  ( ( A ^ 2 )  /  2 ) )  e.  CC )
11 df-3 9364 . . 3  |-  3  =  ( 2  +  1 )
12 2nn0 9580 . . 3  |-  2  e.  NN0
13 df-2 9363 . . . 4  |-  2  =  ( 1  +  1 )
14 1nn0 9579 . . . 4  |-  1  e.  NN0
155a1i 9 . . . 4  |-  ( A  e.  CC  ->  1  e.  CC )
16 1e0p1 9818 . . . . 5  |-  1  =  ( 0  +  1 )
17 0nn0 9578 . . . . 5  |-  0  e.  NN0
18 0cnd 8319 . . . . 5  |-  ( A  e.  CC  ->  0  e.  CC )
191efval2 12432 . . . . . . . 8  |-  ( A  e.  CC  ->  ( exp `  A )  = 
sum_ k  e.  NN0  ( F `  k ) )
20 nn0uz 9957 . . . . . . . . 9  |-  NN0  =  ( ZZ>= `  0 )
2120sumeq1i 12129 . . . . . . . 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 6101 . . . . . 6  |-  ( A  e.  CC  ->  (
0  +  sum_ k  e.  ( ZZ>= `  0 )
( F `  k
) )  =  ( 0  +  ( exp `  A ) ) )
24 efcl 12431 . . . . . . 7  |-  ( A  e.  CC  ->  ( exp `  A )  e.  CC )
2524addlidd 8476 . . . . . 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 12460 . . . . . . 7  |-  ( A  e.  CC  ->  (
( A ^ 0 )  /  ( ! `
 0 ) )  =  1 )
2827oveq2d 6101 . . . . . 6  |-  ( A  e.  CC  ->  (
0  +  ( ( A ^ 0 )  /  ( ! ` 
0 ) ) )  =  ( 0  +  1 ) )
29 0p1e1 9418 . . . . . 6  |-  ( 0  +  1 )  =  1
3028, 29eqtrdi 2287 . . . . 5  |-  ( A  e.  CC  ->  (
0  +  ( ( A ^ 0 )  /  ( ! ` 
0 ) ) )  =  1 )
311, 16, 17, 4, 18, 26, 30efsep 12458 . . . 4  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( 1  +  sum_ k  e.  ( ZZ>= ` 
1 ) ( F `
 k ) ) )
32 exp1 10982 . . . . . . 7  |-  ( A  e.  CC  ->  ( A ^ 1 )  =  A )
33 fac1 11167 . . . . . . . 8  |-  ( ! `
 1 )  =  1
3433a1i 9 . . . . . . 7  |-  ( A  e.  CC  ->  ( ! `  1 )  =  1 )
3532, 34oveq12d 6103 . . . . . 6  |-  ( A  e.  CC  ->  (
( A ^ 1 )  /  ( ! `
 1 ) )  =  ( A  / 
1 ) )
36 div1 9033 . . . . . 6  |-  ( A  e.  CC  ->  ( A  /  1 )  =  A )
3735, 36eqtrd 2271 . . . . 5  |-  ( A  e.  CC  ->  (
( A ^ 1 )  /  ( ! `
 1 ) )  =  A )
3837oveq2d 6101 . . . 4  |-  ( A  e.  CC  ->  (
1  +  ( ( A ^ 1 )  /  ( ! ` 
1 ) ) )  =  ( 1  +  A ) )
391, 13, 14, 4, 15, 31, 38efsep 12458 . . 3  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( ( 1  +  A )  +  sum_ k  e.  ( ZZ>= ` 
2 ) ( F `
 k ) ) )
40 fac2 11169 . . . . . 6  |-  ( ! `
 2 )  =  2
4140oveq2i 6096 . . . . 5  |-  ( ( A ^ 2 )  /  ( ! ` 
2 ) )  =  ( ( A ^
2 )  /  2
)
4241oveq2i 6096 . . . 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 12458 . 2  |-  ( A  e.  CC  ->  ( exp `  A )  =  ( ( ( 1  +  A )  +  ( ( A ^
2 )  /  2
) )  +  sum_ k  e.  ( ZZ>= ` 
3 ) ( F `
 k ) ) )
45 fac3 11170 . . . . 5  |-  ( ! `
 3 )  =  6
4645oveq2i 6096 . . . 4  |-  ( ( A ^ 3 )  /  ( ! ` 
3 ) )  =  ( ( A ^
3 )  /  6
)
4746oveq2i 6096 . . 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 12458 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 4192   ` cfv 5377  (class class class)co 6085   CCcc 8177   0cc0 8179   1c1 8180    + caddc 8182    / cdiv 9002   2c2 9355   3c3 9356   4c4 9357   6c6 9359   NN0cn0 9563   ZZ>=cuz 9921   ^cexp 10975   !cfa 11163   sum_csu 12119   expce 12409
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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299
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 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-frec 6662  df-1o 6687  df-oadd 6691  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-ico 10296  df-fz 10412  df-fzo 10550  df-seqfrec 10885  df-exp 10976  df-fac 11164  df-ihash 11215  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-clim 12045  df-sumdc 12120  df-ef 12415
This theorem is used by:  efi4p  12484
  Copyright terms: Public domain W3C validator