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

Theorem iserex 11108
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 10221 . . . . 5  |-  ( N  =  M  ->  seq N (  +  ,  F )  =  seq M (  +  ,  F ) )
21eleq1d 2208 . . . 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 518 . . . . . . 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 2232 . . . . . . . . . . 11  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
9 eluzelz 9335 . . . . . . . . . . 11  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
108, 9syl 14 . . . . . . . . . 10  |-  ( ph  ->  N  e.  ZZ )
1110zcnd 9174 . . . . . . . . 9  |-  ( ph  ->  N  e.  CC )
12 ax-1cn 7713 . . . . . . . . 9  |-  1  e.  CC
13 npcan 7971 . . . . . . . . 9  |-  ( ( N  e.  CC  /\  1  e.  CC )  ->  ( ( N  - 
1 )  +  1 )  =  N )
1411, 12, 13sylancl 409 . . . . . . . 8  |-  ( ph  ->  ( ( N  - 
1 )  +  1 )  =  N )
1514seqeq1d 10224 . . . . . . 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 519 . . . . . . . 8  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq M (  +  ,  F )  e.  dom  ~~>  )  ->  ( N  - 
1 )  e.  (
ZZ>= `  M ) )
1817, 7eleqtrrdi 2233 . . . . . . 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 11064 . . . . . . . 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 11106 . . . . . 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 3952 . . . . 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 11049 . . . . . 6  |-  Rel  ~~>
2726releldmi 4778 . . . . 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 2233 . . . . . . 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 518 . . . . . . 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 11064 . . . . . . . 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 3950 . . . . . 6  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  seq ( ( N  -  1 )  +  1 ) (  +  ,  F )  ~~>  (  ~~>  `  seq N (  +  ,  F ) ) )
397, 31, 33, 38clim2ser2 11107 . . . . 5  |-  ( ( ( ph  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  /\  seq N (  +  ,  F )  e.  dom  ~~>  )  ->  seq M (  +  ,  F )  ~~>  ( (  ~~>  `
 seq N (  +  ,  F ) )  +  (  seq M
(  +  ,  F
) `  ( N  -  1 ) ) ) )
4026releldmi 4778 . . . . 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 585 . . 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 9356 . . 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 707 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 697    = wceq 1331    e. wcel 1480   class class class wbr 3929   dom cdm 4539   ` cfv 5123  (class class class)co 5774   CCcc 7618   1c1 7621    + caddc 7623    - cmin 7933   ZZcz 9054   ZZ>=cuz 9326    seqcseq 10218    ~~> cli 11047
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-mulrcl 7719  ax-addcom 7720  ax-mulcom 7721  ax-addass 7722  ax-mulass 7723  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-1rid 7727  ax-0id 7728  ax-rnegex 7729  ax-precex 7730  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-apti 7735  ax-pre-ltadd 7736  ax-pre-mulgt0 7737  ax-pre-mulext 7738  ax-arch 7739  ax-caucvg 7740
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-po 4218  df-iso 4219  df-iord 4288  df-on 4290  df-ilim 4291  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-frec 6288  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-reap 8337  df-ap 8344  df-div 8433  df-inn 8721  df-2 8779  df-3 8780  df-4 8781  df-n0 8978  df-z 9055  df-uz 9327  df-rp 9442  df-fz 9791  df-seqfrec 10219  df-exp 10293  df-cj 10614  df-re 10615  df-im 10616  df-rsqrt 10770  df-abs 10771  df-clim 11048
This theorem is referenced by:  isumsplit  11260  isumrpcl  11263  geolim2  11281  cvgratz  11301  cvgratgt0  11302  mertenslemub  11303  mertenslemi1  11304  mertenslem2  11305  mertensabs  11306  eftlcvg  11393  trilpolemisumle  13231  trilpolemeq1  13233  trilpolemlt1  13234
  Copyright terms: Public domain W3C validator