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

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

Proof of Theorem seqeq3
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 987 . . . . . . . 8  |-  ( ( F  =  G  /\  x  e.  ( ZZ>= `  M )  /\  y  e.  _V )  ->  F  =  G )
21fveq1d 5488 . . . . . . 7  |-  ( ( F  =  G  /\  x  e.  ( ZZ>= `  M )  /\  y  e.  _V )  ->  ( F `  ( x  +  1 ) )  =  ( G `  ( x  +  1
) ) )
32oveq2d 5858 . . . . . 6  |-  ( ( F  =  G  /\  x  e.  ( ZZ>= `  M )  /\  y  e.  _V )  ->  (
y  .+  ( F `  ( x  +  1 ) ) )  =  ( y  .+  ( G `  ( x  +  1 ) ) ) )
43opeq2d 3765 . . . . 5  |-  ( ( F  =  G  /\  x  e.  ( ZZ>= `  M )  /\  y  e.  _V )  ->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >.  =  <. ( x  +  1 ) ,  ( y  .+  ( G `  ( x  +  1 ) ) ) >. )
54mpoeq3dva 5906 . . . 4  |-  ( F  =  G  ->  (
x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. )  =  ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( G `  ( x  +  1 ) ) ) >. ) )
6 fveq1 5485 . . . . 5  |-  ( F  =  G  ->  ( F `  M )  =  ( G `  M ) )
76opeq2d 3765 . . . 4  |-  ( F  =  G  ->  <. M , 
( F `  M
) >.  =  <. M , 
( G `  M
) >. )
8 freceq1 6360 . . . . 5  |-  ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >. )  =  ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( G `  ( x  +  1 ) ) ) >. )  -> 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 
.+  ( G `  ( x  +  1
) ) ) >.
) ,  <. M , 
( F `  M
) >. ) )
9 freceq2 6361 . . . . 5  |-  ( <. M ,  ( F `  M ) >.  =  <. M ,  ( G `  M ) >.  -> frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. (
x  +  1 ) ,  ( y  .+  ( G `  ( x  +  1 ) ) ) >. ) ,  <. M ,  ( F `  M ) >. )  = frec ( ( x  e.  ( ZZ>= `  M ) ,  y  e.  _V  |->  <. ( x  +  1 ) ,  ( y 
.+  ( G `  ( x  +  1
) ) ) >.
) ,  <. M , 
( G `  M
) >. ) )
108, 9sylan9eq 2219 . . . 4  |-  ( ( ( x  e.  (
ZZ>= `  M ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
)  =  ( x  e.  ( ZZ>= `  M
) ,  y  e. 
_V  |->  <. ( x  + 
1 ) ,  ( y  .+  ( G `
 ( x  + 
1 ) ) )
>. )  /\  <. M , 
( F `  M
) >.  =  <. M , 
( G `  M
) >. )  -> 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 
.+  ( G `  ( x  +  1
) ) ) >.
) ,  <. M , 
( G `  M
) >. ) )
115, 7, 10syl2anc 409 . . 3  |-  ( F  =  G  -> 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 
.+  ( G `  ( x  +  1
) ) ) >.
) ,  <. M , 
( G `  M
) >. ) )
1211rneqd 4833 . 2  |-  ( F  =  G  ->  ran frec ( ( x  e.  (
ZZ>= `  M ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. M , 
( F `  M
) >. )  =  ran frec ( ( x  e.  (
ZZ>= `  M ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( G `  ( x  +  1
) ) ) >.
) ,  <. M , 
( G `  M
) >. ) )
13 df-seqfrec 10381 . 2  |-  seq M
(  .+  ,  F
)  =  ran frec (
( x  e.  (
ZZ>= `  M ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( F `  ( x  +  1
) ) ) >.
) ,  <. M , 
( F `  M
) >. )
14 df-seqfrec 10381 . 2  |-  seq M
(  .+  ,  G
)  =  ran frec (
( x  e.  (
ZZ>= `  M ) ,  y  e.  _V  |->  <.
( x  +  1 ) ,  ( y 
.+  ( G `  ( x  +  1
) ) ) >.
) ,  <. M , 
( G `  M
) >. )
1512, 13, 143eqtr4g 2224 1  |-  ( F  =  G  ->  seq M (  .+  ,  F )  =  seq M (  .+  ,  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 968    = wceq 1343    e. wcel 2136   _Vcvv 2726   <.cop 3579   ran crn 4605   ` cfv 5188  (class class class)co 5842    e. cmpo 5844  freccfrec 6358   1c1 7754    + caddc 7756   ZZ>=cuz 9466    seqcseq 10380
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-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-mpt 4045  df-cnv 4612  df-dm 4614  df-rn 4615  df-res 4616  df-iota 5153  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-recs 6273  df-frec 6359  df-seqfrec 10381
This theorem is referenced by:  seqeq3d  10388  cbvsum  11301  fsumadd  11347  cbvprod  11499
  Copyright terms: Public domain W3C validator