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

Theorem seqeq3 10452
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 997 . . . . . . . 8  |-  ( ( F  =  G  /\  x  e.  ( ZZ>= `  M )  /\  y  e.  _V )  ->  F  =  G )
21fveq1d 5519 . . . . . . 7  |-  ( ( F  =  G  /\  x  e.  ( ZZ>= `  M )  /\  y  e.  _V )  ->  ( F `  ( x  +  1 ) )  =  ( G `  ( x  +  1
) ) )
32oveq2d 5893 . . . . . 6  |-  ( ( F  =  G  /\  x  e.  ( ZZ>= `  M )  /\  y  e.  _V )  ->  (
y  .+  ( F `  ( x  +  1 ) ) )  =  ( y  .+  ( G `  ( x  +  1 ) ) ) )
43opeq2d 3787 . . . . 5  |-  ( ( F  =  G  /\  x  e.  ( ZZ>= `  M )  /\  y  e.  _V )  ->  <. (
x  +  1 ) ,  ( y  .+  ( F `  ( x  +  1 ) ) ) >.  =  <. ( x  +  1 ) ,  ( y  .+  ( G `  ( x  +  1 ) ) ) >. )
54mpoeq3dva 5941 . . . 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 5516 . . . . 5  |-  ( F  =  G  ->  ( F `  M )  =  ( G `  M ) )
76opeq2d 3787 . . . 4  |-  ( F  =  G  ->  <. M , 
( F `  M
) >.  =  <. M , 
( G `  M
) >. )
8 freceq1 6395 . . . . 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 6396 . . . . 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 2230 . . . 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 411 . . 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 4858 . 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 10448 . 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 10448 . 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 2235 1  |-  ( F  =  G  ->  seq M (  .+  ,  F )  =  seq M (  .+  ,  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 978    = wceq 1353    e. wcel 2148   _Vcvv 2739   <.cop 3597   ran crn 4629   ` cfv 5218  (class class class)co 5877    e. cmpo 5879  freccfrec 6393   1c1 7814    + caddc 7816   ZZ>=cuz 9530    seqcseq 10447
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-mpt 4068  df-cnv 4636  df-dm 4638  df-rn 4639  df-res 4640  df-iota 5180  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-recs 6308  df-frec 6394  df-seqfrec 10448
This theorem is referenced by:  seqeq3d  10455  cbvsum  11370  fsumadd  11416  cbvprod  11568
  Copyright terms: Public domain W3C validator