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

Theorem freceq1 6002
Description: Equality theorem for the finite recursive definition generator. (Contributed by Jim Kingdon, 30-May-2020.)
Assertion
Ref Expression
freceq1  |-  ( F  =  G  -> frec ( F ,  A )  = frec ( G ,  A
) )

Proof of Theorem freceq1
Dummy variables  x  g  m are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 107 . . . . . . . . . . 11  |-  ( ( F  =  G  /\  g  e.  _V )  ->  F  =  G )
21fveq1d 5200 . . . . . . . . . 10  |-  ( ( F  =  G  /\  g  e.  _V )  ->  ( F `  (
g `  m )
)  =  ( G `
 ( g `  m ) ) )
32eleq2d 2148 . . . . . . . . 9  |-  ( ( F  =  G  /\  g  e.  _V )  ->  ( x  e.  ( F `  ( g `
 m ) )  <-> 
x  e.  ( G `
 ( g `  m ) ) ) )
43anbi2d 451 . . . . . . . 8  |-  ( ( F  =  G  /\  g  e.  _V )  ->  ( ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  <->  ( dom  g  =  suc  m  /\  x  e.  ( G `  ( g `  m
) ) ) ) )
54rexbidv 2369 . . . . . . 7  |-  ( ( F  =  G  /\  g  e.  _V )  ->  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  <->  E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( G `  (
g `  m )
) ) ) )
65orbi1d 737 . . . . . 6  |-  ( ( F  =  G  /\  g  e.  _V )  ->  ( ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) )  <->  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( G `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) ) )
76abbidv 2196 . . . . 5  |-  ( ( F  =  G  /\  g  e.  _V )  ->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) }  =  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( G `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )
87mpteq2dva 3868 . . . 4  |-  ( F  =  G  ->  (
g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )  =  ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( G `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )
9 recseq 5944 . . . 4  |-  ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )  =  ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( G `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )  -> recs ( (
g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  = recs (
( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( G `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) ) )
108, 9syl 14 . . 3  |-  ( F  =  G  -> recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  = recs (
( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( G `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) ) )
1110reseq1d 4629 . 2  |-  ( F  =  G  ->  (recs ( ( g  e. 
_V  |->  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )  =  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( G `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )
)
12 df-frec 6001 . 2  |- frec ( F ,  A )  =  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )
13 df-frec 6001 . 2  |- frec ( G ,  A )  =  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( G `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )
1411, 12, 133eqtr4g 2138 1  |-  ( F  =  G  -> frec ( F ,  A )  = frec ( G ,  A
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    \/ wo 661    = wceq 1284    e. wcel 1433   {cab 2067   E.wrex 2349   _Vcvv 2601   (/)c0 3251    |-> cmpt 3839   suc csuc 4120   omcom 4331   dom cdm 4363    |` cres 4365   ` cfv 4922  recscrecs 5942  freccfrec 6000
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-in 2979  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-res 4375  df-iota 4887  df-fv 4930  df-recs 5943  df-frec 6001
This theorem is referenced by:  iseqeq1  9434  iseqeq2  9435  iseqeq3  9436  iseqeq4  9437  iseqval  9440
  Copyright terms: Public domain W3C validator