MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  seqid Structured version   Unicode version

Theorem seqid 12130
Description: Discard the first few terms of a sequence that starts with all zeroes (or whatever the identity  Z is for operation  .+). (Contributed by Mario Carneiro, 13-Jul-2013.) (Revised by Mario Carneiro, 27-May-2014.)
Hypotheses
Ref Expression
seqid.1  |-  ( (
ph  /\  x  e.  S )  ->  ( Z  .+  x )  =  x )
seqid.2  |-  ( ph  ->  Z  e.  S )
seqid.3  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
seqid.4  |-  ( ph  ->  ( F `  N
)  e.  S )
seqid.5  |-  ( (
ph  /\  x  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  x )  =  Z )
Assertion
Ref Expression
seqid  |-  ( ph  ->  (  seq M ( 
.+  ,  F )  |`  ( ZZ>= `  N )
)  =  seq N
(  .+  ,  F
) )
Distinct variable groups:    x,  .+    x, F    x, M    x, N    x, S    x, Z    ph, x

Proof of Theorem seqid
StepHypRef Expression
1 seqid.3 . 2  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
2 eluzelz 11101 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
3 seq1 12098 . . . . 5  |-  ( N  e.  ZZ  ->  (  seq N (  .+  ,  F ) `  N
)  =  ( F `
 N ) )
41, 2, 33syl 20 . . . 4  |-  ( ph  ->  (  seq N ( 
.+  ,  F ) `
 N )  =  ( F `  N
) )
5 seqeq1 12088 . . . . . 6  |-  ( N  =  M  ->  seq N (  .+  ,  F )  =  seq M (  .+  ,  F ) )
65fveq1d 5873 . . . . 5  |-  ( N  =  M  ->  (  seq N (  .+  ,  F ) `  N
)  =  (  seq M (  .+  ,  F ) `  N
) )
76eqeq1d 2469 . . . 4  |-  ( N  =  M  ->  (
(  seq N (  .+  ,  F ) `  N
)  =  ( F `
 N )  <->  (  seq M (  .+  ,  F ) `  N
)  =  ( F `
 N ) ) )
84, 7syl5ibcom 220 . . 3  |-  ( ph  ->  ( N  =  M  ->  (  seq M
(  .+  ,  F
) `  N )  =  ( F `  N ) ) )
9 eluzel2 11097 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
101, 9syl 16 . . . . . 6  |-  ( ph  ->  M  e.  ZZ )
11 seqm1 12102 . . . . . 6  |-  ( ( M  e.  ZZ  /\  N  e.  ( ZZ>= `  ( M  +  1
) ) )  -> 
(  seq M (  .+  ,  F ) `  N
)  =  ( (  seq M (  .+  ,  F ) `  ( N  -  1 ) )  .+  ( F `
 N ) ) )
1210, 11sylan 471 . . . . 5  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  (  seq M (  .+  ,  F ) `  N
)  =  ( (  seq M (  .+  ,  F ) `  ( N  -  1 ) )  .+  ( F `
 N ) ) )
13 seqid.2 . . . . . . . . 9  |-  ( ph  ->  Z  e.  S )
14 seqid.1 . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  S )  ->  ( Z  .+  x )  =  x )
1514ralrimiva 2881 . . . . . . . . 9  |-  ( ph  ->  A. x  e.  S  ( Z  .+  x )  =  x )
16 oveq2 6302 . . . . . . . . . . 11  |-  ( x  =  Z  ->  ( Z  .+  x )  =  ( Z  .+  Z
) )
17 id 22 . . . . . . . . . . 11  |-  ( x  =  Z  ->  x  =  Z )
1816, 17eqeq12d 2489 . . . . . . . . . 10  |-  ( x  =  Z  ->  (
( Z  .+  x
)  =  x  <->  ( Z  .+  Z )  =  Z ) )
1918rspcv 3215 . . . . . . . . 9  |-  ( Z  e.  S  ->  ( A. x  e.  S  ( Z  .+  x )  =  x  ->  ( Z  .+  Z )  =  Z ) )
2013, 15, 19sylc 60 . . . . . . . 8  |-  ( ph  ->  ( Z  .+  Z
)  =  Z )
2120adantr 465 . . . . . . 7  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  ( Z  .+  Z )  =  Z )
22 eluzp1m1 11115 . . . . . . . 8  |-  ( ( M  e.  ZZ  /\  N  e.  ( ZZ>= `  ( M  +  1
) ) )  -> 
( N  -  1 )  e.  ( ZZ>= `  M ) )
2310, 22sylan 471 . . . . . . 7  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  ( N  -  1 )  e.  ( ZZ>= `  M )
)
24 seqid.5 . . . . . . . 8  |-  ( (
ph  /\  x  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  x )  =  Z )
2524adantlr 714 . . . . . . 7  |-  ( ( ( ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  /\  x  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  x )  =  Z )
2621, 23, 25seqid3 12129 . . . . . 6  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  (  seq M (  .+  ,  F ) `  ( N  -  1 ) )  =  Z )
2726oveq1d 6309 . . . . 5  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  ( (  seq M (  .+  ,  F ) `  ( N  -  1 ) )  .+  ( F `
 N ) )  =  ( Z  .+  ( F `  N ) ) )
28 seqid.4 . . . . . . 7  |-  ( ph  ->  ( F `  N
)  e.  S )
2928adantr 465 . . . . . 6  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  ( F `  N )  e.  S
)
3015adantr 465 . . . . . 6  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  A. x  e.  S  ( Z  .+  x )  =  x )
31 oveq2 6302 . . . . . . . 8  |-  ( x  =  ( F `  N )  ->  ( Z  .+  x )  =  ( Z  .+  ( F `  N )
) )
32 id 22 . . . . . . . 8  |-  ( x  =  ( F `  N )  ->  x  =  ( F `  N ) )
3331, 32eqeq12d 2489 . . . . . . 7  |-  ( x  =  ( F `  N )  ->  (
( Z  .+  x
)  =  x  <->  ( Z  .+  ( F `  N
) )  =  ( F `  N ) ) )
3433rspcv 3215 . . . . . 6  |-  ( ( F `  N )  e.  S  ->  ( A. x  e.  S  ( Z  .+  x )  =  x  ->  ( Z  .+  ( F `  N ) )  =  ( F `  N
) ) )
3529, 30, 34sylc 60 . . . . 5  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  ( Z  .+  ( F `  N
) )  =  ( F `  N ) )
3612, 27, 353eqtrd 2512 . . . 4  |-  ( (
ph  /\  N  e.  ( ZZ>= `  ( M  +  1 ) ) )  ->  (  seq M (  .+  ,  F ) `  N
)  =  ( F `
 N ) )
3736ex 434 . . 3  |-  ( ph  ->  ( N  e.  (
ZZ>= `  ( M  + 
1 ) )  -> 
(  seq M (  .+  ,  F ) `  N
)  =  ( F `
 N ) ) )
38 uzp1 11125 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( N  =  M  \/  N  e.  ( ZZ>= `  ( M  +  1 ) ) ) )
391, 38syl 16 . . 3  |-  ( ph  ->  ( N  =  M  \/  N  e.  (
ZZ>= `  ( M  + 
1 ) ) ) )
408, 37, 39mpjaod 381 . 2  |-  ( ph  ->  (  seq M ( 
.+  ,  F ) `
 N )  =  ( F `  N
) )
41 eqidd 2468 . 2  |-  ( (
ph  /\  x  e.  ( ZZ>= `  ( N  +  1 ) ) )  ->  ( F `  x )  =  ( F `  x ) )
421, 40, 41seqfeq2 12108 1  |-  ( ph  ->  (  seq M ( 
.+  ,  F )  |`  ( ZZ>= `  N )
)  =  seq N
(  .+  ,  F
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    \/ wo 368    /\ wa 369    = wceq 1379    e. wcel 1767   A.wral 2817    |` cres 5006   ` cfv 5593  (class class class)co 6294   1c1 9503    + caddc 9505    - cmin 9815   ZZcz 10874   ZZ>=cuz 11092   ...cfz 11682    seqcseq 12085
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4573  ax-nul 4581  ax-pow 4630  ax-pr 4691  ax-un 6586  ax-cnex 9558  ax-resscn 9559  ax-1cn 9560  ax-icn 9561  ax-addcl 9562  ax-addrcl 9563  ax-mulcl 9564  ax-mulrcl 9565  ax-mulcom 9566  ax-addass 9567  ax-mulass 9568  ax-distr 9569  ax-i2m1 9570  ax-1ne0 9571  ax-1rid 9572  ax-rnegex 9573  ax-rrecex 9574  ax-cnre 9575  ax-pre-lttri 9576  ax-pre-lttrn 9577  ax-pre-ltadd 9578  ax-pre-mulgt0 9579
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-nel 2665  df-ral 2822  df-rex 2823  df-reu 2824  df-rab 2826  df-v 3120  df-sbc 3337  df-csb 3441  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-pss 3497  df-nul 3791  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-tp 4037  df-op 4039  df-uni 4251  df-iun 4332  df-br 4453  df-opab 4511  df-mpt 4512  df-tr 4546  df-eprel 4796  df-id 4800  df-po 4805  df-so 4806  df-fr 4843  df-we 4845  df-ord 4886  df-on 4887  df-lim 4888  df-suc 4889  df-xp 5010  df-rel 5011  df-cnv 5012  df-co 5013  df-dm 5014  df-rn 5015  df-res 5016  df-ima 5017  df-iota 5556  df-fun 5595  df-fn 5596  df-f 5597  df-f1 5598  df-fo 5599  df-f1o 5600  df-fv 5601  df-riota 6255  df-ov 6297  df-oprab 6298  df-mpt2 6299  df-om 6695  df-1st 6794  df-2nd 6795  df-recs 7052  df-rdg 7086  df-er 7321  df-en 7527  df-dom 7528  df-sdom 7529  df-pnf 9640  df-mnf 9641  df-xr 9642  df-ltxr 9643  df-le 9644  df-sub 9817  df-neg 9818  df-nn 10547  df-n0 10806  df-z 10875  df-uz 11093  df-fz 11683  df-seq 12086
This theorem is referenced by:  seqcoll  12488  sumrblem  13508  logtayl  22884  leibpilem2  23115  prodrblem  28956
  Copyright terms: Public domain W3C validator