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

Theorem freceq1 6297
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 108 . . . . . . . . . . 11  |-  ( ( F  =  G  /\  g  e.  _V )  ->  F  =  G )
21fveq1d 5431 . . . . . . . . . 10  |-  ( ( F  =  G  /\  g  e.  _V )  ->  ( F `  (
g `  m )
)  =  ( G `
 ( g `  m ) ) )
32eleq2d 2210 . . . . . . . . 9  |-  ( ( F  =  G  /\  g  e.  _V )  ->  ( x  e.  ( F `  ( g `
 m ) )  <-> 
x  e.  ( G `
 ( g `  m ) ) ) )
43anbi2d 460 . . . . . . . 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 2439 . . . . . . 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 781 . . . . . 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 2258 . . . . 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 4026 . . . 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 6211 . . . 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 4826 . 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 6296 . 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 6296 . 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 2198 1  |-  ( F  =  G  -> frec ( F ,  A )  = frec ( G ,  A
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    \/ wo 698    = wceq 1332    e. wcel 1481   {cab 2126   E.wrex 2418   _Vcvv 2689   (/)c0 3368    |-> cmpt 3997   suc csuc 4295   omcom 4512   dom cdm 4547    |` cres 4549   ` cfv 5131  recscrecs 6209  freccfrec 6295
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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-in 3082  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-res 4559  df-iota 5096  df-fv 5139  df-recs 6210  df-frec 6296
This theorem is referenced by:  frecuzrdgdom  10222  frecuzrdgfun  10224  frecuzrdgsuct  10228  seqeq1  10252  seqeq2  10253  seqeq3  10254  iseqvalcbv  10261  hashfz1  10561  ennnfonelemr  11972  ctinfom  11977  isomninn  13401  iswomninn  13418  ismkvnn  13420
  Copyright terms: Public domain W3C validator