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

Theorem seqeq1 10775
Description: Equality theorem for the sequence builder operation. (Contributed by Mario Carneiro, 4-Sep-2013.)
Assertion
Ref Expression
seqeq1  |-  ( M  =  N  ->  seq M (  .+  ,  F )  =  seq N (  .+  ,  F ) )

Proof of Theorem seqeq1
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 id 19 . . . . . 6  |-  ( M  =  N  ->  M  =  N )
2 fveq2 5648 . . . . . 6  |-  ( M  =  N  ->  ( F `  M )  =  ( F `  N ) )
31, 2opeq12d 3875 . . . . 5  |-  ( M  =  N  ->  <. M , 
( F `  M
) >.  =  <. N , 
( F `  N
) >. )
4 freceq2 6602 . . . . 5  |-  ( <. M ,  ( F `  M ) >.  =  <. N ,  ( F `  N ) >.  -> frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. ) ,  <. M ,  ( F `  M ) >. )  = frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. ( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. N , 
( F `  N
) >. ) )
53, 4syl 14 . . . 4  |-  ( M  =  N  -> frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. ) ,  <. M ,  ( F `  M ) >. )  = frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. ( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. N , 
( F `  N
) >. ) )
6 fveq2 5648 . . . . . 6  |-  ( M  =  N  ->  ( ZZ>=
`  M )  =  ( ZZ>= `  N )
)
7 eqid 2231 . . . . . 6  |-  _V  =  _V
8 mpoeq12 6091 . . . . . 6  |-  ( ( ( ZZ>= `  M )  =  ( ZZ>= `  N
)  /\  _V  =  _V )  ->  ( x  e.  ( ZZ>= `  M
) ,  y  e. 
_V  |->  <. ( x  + 
1 ) ,  ( y  .+  ( F `
 ( x  + 
1 ) ) )
>. )  =  (
x  e.  ( ZZ>= `  N ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. ) )
96, 7, 8sylancl 413 . . . . 5  |-  ( M  =  N  ->  (
x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. )  =  ( x  e.  ( ZZ>= `  N ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. ) )
10 freceq1 6601 . . . . 5  |-  ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. )  =  ( x  e.  ( ZZ>= `  N ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. )  -> frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. ) ,  <. N ,  ( F `  N ) >. )  = frec ( ( x  e.  ( ZZ>= `  N ) ,  y  e.  _V  |->  <. ( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. N , 
( F `  N
) >. ) )
119, 10syl 14 . . . 4  |-  ( M  =  N  -> frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. ) ,  <. N ,  ( F `  N ) >. )  = frec ( ( x  e.  ( ZZ>= `  N ) ,  y  e.  _V  |->  <. ( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. N , 
( F `  N
) >. ) )
125, 11eqtrd 2264 . . 3  |-  ( M  =  N  -> frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. ) ,  <. M ,  ( F `  M ) >. )  = frec ( ( x  e.  ( ZZ>= `  N ) ,  y  e.  _V  |->  <. ( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. N , 
( F `  N
) >. ) )
1312rneqd 4967 . 2  |-  ( M  =  N  ->  ran frec ( ( x  e.  (
ZZ>= `  M ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. M , 
( F `  M
) >. )  =  ran frec ( ( x  e.  (
ZZ>= `  N ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. N , 
( F `  N
) >. ) )
14 df-seqfrec 10773 . 2  |-  seq M
(  .+  ,  F
)  =  ran frec (
( x  e.  (
ZZ>= `  M ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. M , 
( F `  M
) >. )
15 df-seqfrec 10773 . 2  |-  seq N
(  .+  ,  F
)  =  ran frec (
( x  e.  (
ZZ>= `  N ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. N , 
( F `  N
) >. )
1613, 14, 153eqtr4g 2289 1  |-  ( M  =  N  ->  seq M (  .+  ,  F )  =  seq N (  .+  ,  F ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398   _Vcvv 2803   <.cop 3676   ran crn 4732   ` cfv 5333  (class class class)co 6028    e. cmpo 6030  freccfrec 6599   1c1 8093    + caddc 8095   ZZ>=cuz 9816    seqcseq 10772
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-cnv 4739  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fv 5341  df-oprab 6032  df-mpo 6033  df-recs 6514  df-frec 6600  df-seqfrec 10773
This theorem is referenced by:  seqeq1d  10778  seq3f1olemqsum  10838  seqf1oglem2  10845  seq3id  10850  seq3z  10853  iserex  11979  summodclem2  12023  summodc  12024  zsumdc  12025  isumsplit  12132  ntrivcvgap  12189  ntrivcvgap0  12190  prodmodclem2  12218  prodmodc  12219  zproddc  12220  fprodntrivap  12225  ege2le3  12312  gsumfzval  13554  gsumval2  13560
  Copyright terms: Public domain W3C validator