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

Theorem frecsuc 6651
Description: The successor value resulting from finite recursive definition generation. (Contributed by Jim Kingdon, 31-Mar-2022.)
Assertion
Ref Expression
frecsuc  |-  ( ( A. z  e.  S  ( F `  z )  e.  S  /\  A  e.  S  /\  B  e. 
om )  ->  (frec ( F ,  A ) `
 suc  B )  =  ( F `  (frec ( F ,  A
) `  B )
) )
Distinct variable groups:    z, F    z, S
Allowed substitution hints:    A( z)    B( z)

Proof of Theorem frecsuc
Dummy variables  f  g  m  x  y  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmeq 4961 . . . . . . . . 9  |-  ( f  =  g  ->  dom  f  =  dom  g )
21eqeq1d 2243 . . . . . . . 8  |-  ( f  =  g  ->  ( dom  f  =  suc  n 
<->  dom  g  =  suc  n ) )
3 fveq1 5674 . . . . . . . . . 10  |-  ( f  =  g  ->  (
f `  n )  =  ( g `  n ) )
43fveq2d 5679 . . . . . . . . 9  |-  ( f  =  g  ->  ( F `  ( f `  n ) )  =  ( F `  (
g `  n )
) )
54eleq2d 2304 . . . . . . . 8  |-  ( f  =  g  ->  (
y  e.  ( F `
 ( f `  n ) )  <->  y  e.  ( F `  ( g `
 n ) ) ) )
62, 5anbi12d 473 . . . . . . 7  |-  ( f  =  g  ->  (
( dom  f  =  suc  n  /\  y  e.  ( F `  (
f `  n )
) )  <->  ( dom  g  =  suc  n  /\  y  e.  ( F `  ( g `  n
) ) ) ) )
76rexbidv 2545 . . . . . 6  |-  ( f  =  g  ->  ( E. n  e.  om  ( dom  f  =  suc  n  /\  y  e.  ( F `  ( f `
 n ) ) )  <->  E. n  e.  om  ( dom  g  =  suc  n  /\  y  e.  ( F `  ( g `
 n ) ) ) ) )
81eqeq1d 2243 . . . . . . 7  |-  ( f  =  g  ->  ( dom  f  =  (/)  <->  dom  g  =  (/) ) )
98anbi1d 465 . . . . . 6  |-  ( f  =  g  ->  (
( dom  f  =  (/) 
/\  y  e.  A
)  <->  ( dom  g  =  (/)  /\  y  e.  A ) ) )
107, 9orbi12d 801 . . . . 5  |-  ( f  =  g  ->  (
( E. n  e. 
om  ( dom  f  =  suc  n  /\  y  e.  ( F `  (
f `  n )
) )  \/  ( dom  f  =  (/)  /\  y  e.  A ) )  <->  ( E. n  e.  om  ( dom  g  =  suc  n  /\  y  e.  ( F `  ( g `
 n ) ) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) ) )
1110abbidv 2354 . . . 4  |-  ( f  =  g  ->  { y  |  ( E. n  e.  om  ( dom  f  =  suc  n  /\  y  e.  ( F `  (
f `  n )
) )  \/  ( dom  f  =  (/)  /\  y  e.  A ) ) }  =  { y  |  ( E. n  e. 
om  ( dom  g  =  suc  n  /\  y  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) } )
1211cbvmptv 4211 . . 3  |-  ( f  e.  _V  |->  { y  |  ( E. n  e.  om  ( dom  f  =  suc  n  /\  y  e.  ( F `  (
f `  n )
) )  \/  ( dom  f  =  (/)  /\  y  e.  A ) ) } )  =  ( g  e.  _V  |->  { y  |  ( E. n  e.  om  ( dom  g  =  suc  n  /\  y  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) } )
13 eleq1 2297 . . . . . . . 8  |-  ( y  =  x  ->  (
y  e.  ( F `
 ( g `  n ) )  <->  x  e.  ( F `  ( g `
 n ) ) ) )
1413anbi2d 464 . . . . . . 7  |-  ( y  =  x  ->  (
( dom  g  =  suc  n  /\  y  e.  ( F `  (
g `  n )
) )  <->  ( dom  g  =  suc  n  /\  x  e.  ( F `  ( g `  n
) ) ) ) )
1514rexbidv 2545 . . . . . 6  |-  ( y  =  x  ->  ( E. n  e.  om  ( dom  g  =  suc  n  /\  y  e.  ( F `  ( g `
 n ) ) )  <->  E. n  e.  om  ( dom  g  =  suc  n  /\  x  e.  ( F `  ( g `
 n ) ) ) ) )
16 eleq1 2297 . . . . . . 7  |-  ( y  =  x  ->  (
y  e.  A  <->  x  e.  A ) )
1716anbi2d 464 . . . . . 6  |-  ( y  =  x  ->  (
( dom  g  =  (/) 
/\  y  e.  A
)  <->  ( dom  g  =  (/)  /\  x  e.  A ) ) )
1815, 17orbi12d 801 . . . . 5  |-  ( y  =  x  ->  (
( E. n  e. 
om  ( dom  g  =  suc  n  /\  y  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) )  <->  ( E. n  e.  om  ( dom  g  =  suc  n  /\  x  e.  ( F `  ( g `
 n ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) ) )
1918cbvabv 2361 . . . 4  |-  { y  |  ( E. n  e.  om  ( dom  g  =  suc  n  /\  y  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) }  =  { x  |  ( E. n  e. 
om  ( dom  g  =  suc  n  /\  x  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) }
2019mpteq2i 4202 . . 3  |-  ( g  e.  _V  |->  { y  |  ( E. n  e.  om  ( dom  g  =  suc  n  /\  y  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) } )  =  ( g  e.  _V  |->  { x  |  ( E. n  e.  om  ( dom  g  =  suc  n  /\  x  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )
21 suceq 4528 . . . . . . . . 9  |-  ( n  =  m  ->  suc  n  =  suc  m )
2221eqeq2d 2246 . . . . . . . 8  |-  ( n  =  m  ->  ( dom  g  =  suc  n 
<->  dom  g  =  suc  m ) )
23 fveq2 5675 . . . . . . . . . 10  |-  ( n  =  m  ->  (
g `  n )  =  ( g `  m ) )
2423fveq2d 5679 . . . . . . . . 9  |-  ( n  =  m  ->  ( F `  ( g `  n ) )  =  ( F `  (
g `  m )
) )
2524eleq2d 2304 . . . . . . . 8  |-  ( n  =  m  ->  (
x  e.  ( F `
 ( g `  n ) )  <->  x  e.  ( F `  ( g `
 m ) ) ) )
2622, 25anbi12d 473 . . . . . . 7  |-  ( n  =  m  ->  (
( dom  g  =  suc  n  /\  x  e.  ( F `  (
g `  n )
) )  <->  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `  m
) ) ) ) )
2726cbvrexv 2781 . . . . . 6  |-  ( E. n  e.  om  ( dom  g  =  suc  n  /\  x  e.  ( F `  ( g `
 n ) ) )  <->  E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) ) )
2827orbi1i 771 . . . . 5  |-  ( ( E. n  e.  om  ( dom  g  =  suc  n  /\  x  e.  ( F `  ( g `
 n ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) )  <->  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) )
2928abbii 2350 . . . 4  |-  { x  |  ( E. n  e.  om  ( dom  g  =  suc  n  /\  x  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) }  =  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) }
3029mpteq2i 4202 . . 3  |-  ( g  e.  _V  |->  { x  |  ( E. n  e.  om  ( dom  g  =  suc  n  /\  x  e.  ( F `  (
g `  n )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )  =  ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )
3112, 20, 303eqtri 2259 . 2  |-  ( f  e.  _V  |->  { y  |  ( E. n  e.  om  ( dom  f  =  suc  n  /\  y  e.  ( F `  (
f `  n )
) )  \/  ( dom  f  =  (/)  /\  y  e.  A ) ) } )  =  ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )
3231frecsuclem 6650 1  |-  ( ( A. z  e.  S  ( F `  z )  e.  S  /\  A  e.  S  /\  B  e. 
om )  ->  (frec ( F ,  A ) `
 suc  B )  =  ( F `  (frec ( F ,  A
) `  B )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 716    /\ w3a 1005    = wceq 1398    e. wcel 2205   {cab 2220   A.wral 2522   E.wrex 2523   _Vcvv 2815   (/)c0 3512    |-> cmpt 4176   suc csuc 4491   omcom 4717   dom cdm 4754   ` cfv 5357  freccfrec 6634
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-in1 619  ax-in2 620  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-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-recs 6549  df-frec 6635
This theorem is referenced by:  frecrdg  6652  frec2uzsucd  10787  frec2uzrdg  10795  frecuzrdgsuc  10800  frecuzrdgg  10802  frecuzrdgsuctlem  10809  seq3val  10846  seqvalcd  10847
  Copyright terms: Public domain W3C validator