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

Theorem iserex 11302
Description: An infinite series converges, if and only if the series does with initial terms removed. (Contributed by Paul Chapman, 9-Feb-2008.) (Revised by Mario Carneiro, 27-Apr-2014.)
Hypotheses
Ref Expression
clim2ser.1  |-  Z  =  ( ZZ>= `  M )
iserex.2  |-  ( ph  ->  N  e.  Z )
iserex.3  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  e.  CC )
Assertion
Ref Expression
iserex  |-  ( ph  ->  (  seq M (  +  ,  F )  e.  dom  ~~>  <->  seq N (  +  ,  F )  e.  dom  ~~>  ) )
Distinct variable groups:    k, F    k, M    k, N    ph, k    k, Z

Proof of Theorem iserex
StepHypRef Expression
1 seqeq1 10404 . . . . 5  |-  ( N  =  M  ->  seq N (  +  ,  F )  =  seq M (  +  ,  F ) )
21eleq1d 2239 . . . 4  |-  ( N  =  M  ->  (  seq N (  +  ,  F )  e.  dom  ~~>  <->  seq M (  +  ,  F )  e.  dom  ~~>  ) )
32bicomd 140 . . 3  |-  ( N  =  M  ->  (  seq M (  +  ,  F )  e.  dom  ~~>  <->  seq N (  +  ,  F )  e.  dom  ~~>  ) )
43a1i 9 . 2  |-  ( ph  ->  ( N  =  M  ->  (  seq M
(  +  ,  F
)  e.  dom  ~~>  <->  seq N (  +  ,  F )  e.  dom  ~~>  ) ) )
5 simpll 524 . . . . . . 7  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  ph )
6 iserex.2 . . . . . . . . . . . 12  |-  ( ph  ->  N  e.  Z )
7 clim2ser.1 . . . . . . . . . . . 12  |-  Z  =  ( ZZ>= `  M )
86, 7eleqtrdi 2263 . . . . . . . . . . 11  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
9 eluzelz 9496 . . . . . . . . . . 11  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
108, 9syl 14 . . . . . . . . . 10  |-  ( ph  ->  N  e.  ZZ )
1110zcnd 9335 . . . . . . . . 9  |-  ( ph  ->  N  e.  CC )
12 ax-1cn 7867 . . . . . . . . 9  |-  1  e.  CC
13 npcan 8128 . . . . . . . . 9  |-  ( ( N  e.  CC  /\  1  e.  CC )  ->  ( ( N  - 
1 )  +  1 )  =  N )
1411, 12, 13sylancl 411 . . . . . . . 8  |-  ( ph  ->  ( ( N  - 
1 )  +  1 )  =  N )
1514seqeq1d 10407 . . . . . . 7  |-  ( ph  ->  seq ( ( N  -  1 )  +  1 ) (  +  ,  F )  =  seq N (  +  ,  F ) )
165, 15syl 14 . . . . . 6  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  seq ( ( N  -  1 )  +  1 ) (  +  ,  F )  =  seq N (  +  ,  F ) )
17 simplr 525 . . . . . . . 8  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  ( N  - 
1 )  e.  (
ZZ>= `  M ) )
1817, 7eleqtrrdi 2264 . . . . . . 7  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  ( N  - 
1 )  e.  Z
)
19 iserex.3 . . . . . . . 8  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  e.  CC )
205, 19sylan 281 . . . . . . 7  |-  ( ( ( ( ph  /\  ( N  -  1
)  e.  ( ZZ>= `  M ) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  /\  k  e.  Z
)  ->  ( F `  k )  e.  CC )
21 simpr 109 . . . . . . . 8  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  seq M (  +  ,  F )  e. 
dom 
~~>  )
22 climdm 11258 . . . . . . . 8  |-  (  seq M (  +  ,  F )  e.  dom  ~~>  <->  seq M (  +  ,  F )  ~~>  (  ~~>  `  seq M (  +  ,  F ) ) )
2321, 22sylib 121 . . . . . . 7  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  seq M (  +  ,  F )  ~~>  (  ~~>  `  seq M (  +  ,  F ) ) )
247, 18, 20, 23clim2ser 11300 . . . . . 6  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  seq ( ( N  -  1 )  +  1 ) (  +  ,  F )  ~~>  ( (  ~~>  `
 seq M (  +  ,  F ) )  -  (  seq M
(  +  ,  F
) `  ( N  -  1 ) ) ) )
2516, 24eqbrtrrd 4013 . . . . 5  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  seq N (  +  ,  F )  ~~>  ( (  ~~>  `
 seq M (  +  ,  F ) )  -  (  seq M
(  +  ,  F
) `  ( N  -  1 ) ) ) )
26 climrel 11243 . . . . . 6  |-  Rel  ~~>
2726releldmi 4850 . . . . 5  |-  (  seq N (  +  ,  F )  ~~>  ( (  ~~>  `
 seq M (  +  ,  F ) )  -  (  seq M
(  +  ,  F
) `  ( N  -  1 ) ) )  ->  seq N (  +  ,  F )  e.  dom  ~~>  )
2825, 27syl 14 . . . 4  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  seq N (  +  ,  F )  e. 
dom 
~~>  )
29 simpr 109 . . . . . . . 8  |-  ( (
ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M )
)  ->  ( N  -  1 )  e.  ( ZZ>= `  M )
)
3029, 7eleqtrrdi 2264 . . . . . . 7  |-  ( (
ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M )
)  ->  ( N  -  1 )  e.  Z )
3130adantr 274 . . . . . 6  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  ( N  - 
1 )  e.  Z
)
32 simpll 524 . . . . . . 7  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  ph )
3332, 19sylan 281 . . . . . 6  |-  ( ( ( ( ph  /\  ( N  -  1
)  e.  ( ZZ>= `  M ) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  /\  k  e.  Z
)  ->  ( F `  k )  e.  CC )
3432, 15syl 14 . . . . . . 7  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  seq ( ( N  -  1 )  +  1 ) (  +  ,  F )  =  seq N (  +  ,  F ) )
35 simpr 109 . . . . . . . 8  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  seq N (  +  ,  F )  e. 
dom 
~~>  )
36 climdm 11258 . . . . . . . 8  |-  (  seq N (  +  ,  F )  e.  dom  ~~>  <->  seq N (  +  ,  F )  ~~>  (  ~~>  `  seq N (  +  ,  F ) ) )
3735, 36sylib 121 . . . . . . 7  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  seq N (  +  ,  F )  ~~>  (  ~~>  `  seq N (  +  ,  F ) ) )
3834, 37eqbrtrd 4011 . . . . . 6  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  seq ( ( N  -  1 )  +  1 ) (  +  ,  F )  ~~>  (  ~~>  `  seq N (  +  ,  F ) ) )
397, 31, 33, 38clim2ser2 11301 . . . . 5  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  seq M (  +  ,  F )  ~~>  ( (  ~~>  `
 seq N (  +  ,  F ) )  +  (  seq M
(  +  ,  F
) `  ( N  -  1 ) ) ) )
4026releldmi 4850 . . . . 5  |-  (  seq M (  +  ,  F )  ~~>  ( (  ~~>  `
 seq N (  +  ,  F ) )  +  (  seq M
(  +  ,  F
) `  ( N  -  1 ) ) )  ->  seq M (  +  ,  F )  e.  dom  ~~>  )
4139, 40syl 14 . . . 4  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  seq M (  +  ,  F )  e. 
dom 
~~>  )
4228, 41impbida 591 . . 3  |-  ( (
ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M )
)  ->  (  seq M (  +  ,  F )  e.  dom  ~~>  <->  seq N (  +  ,  F )  e.  dom  ~~>  ) )
4342ex 114 . 2  |-  ( ph  ->  ( ( N  - 
1 )  e.  (
ZZ>= `  M )  -> 
(  seq M (  +  ,  F )  e. 
dom 
~~> 
<->  seq N (  +  ,  F )  e. 
dom 
~~>  ) ) )
44 uzm1 9517 . . 3  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( N  =  M  \/  ( N  -  1 )  e.  ( ZZ>= `  M
) ) )
458, 44syl 14 . 2  |-  ( ph  ->  ( N  =  M  \/  ( N  - 
1 )  e.  (
ZZ>= `  M ) ) )
464, 43, 45mpjaod 713 1  |-  ( ph  ->  (  seq M (  +  ,  F )  e.  dom  ~~>  <->  seq N (  +  ,  F )  e.  dom  ~~>  ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 703    = wceq 1348    e. wcel 2141   class class class wbr 3989   dom cdm 4611   ` cfv 5198  (class class class)co 5853   CCcc 7772   1c1 7775    + caddc 7777    - cmin 8090   ZZcz 9212   ZZ>=cuz 9487    seqcseq 10401    ~~> cli 11241
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  ax-arch 7893  ax-caucvg 7894
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-2 8937  df-3 8938  df-4 8939  df-n0 9136  df-z 9213  df-uz 9488  df-rp 9611  df-fz 9966  df-seqfrec 10402  df-exp 10476  df-cj 10806  df-re 10807  df-im 10808  df-rsqrt 10962  df-abs 10963  df-clim 11242
This theorem is referenced by:  isumsplit  11454  isumrpcl  11457  geolim2  11475  cvgratz  11495  cvgratgt0  11496  mertenslemub  11497  mertenslemi1  11498  mertenslem2  11499  mertensabs  11500  eftlcvg  11650  trilpolemisumle  14070  trilpolemeq1  14072  trilpolemlt1  14073  nconstwlpolemgt0  14095
  Copyright terms: Public domain W3C validator