HomeHome Intuitionistic Logic Explorer
Theorem List (p. 64 of 139)
< Previous  Next >
Browser slow? Try the
Unicode version.

Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 6301-6400   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremtfr1onlemsucaccv 6301* Lemma for tfr1on 6310. We can extend an acceptable function by one element to produce an acceptable function. (Contributed by Jim Kingdon, 12-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  ( ph  ->  Y  e.  X )   &    |-  ( ph  ->  z  e.  Y )   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  g  Fn  z )   &    |-  ( ph  ->  g  e.  A )   =>    |-  ( ph  ->  (
 g  u.  { <. z ,  ( G `  g ) >. } )  e.  A )
 
Theoremtfr1onlembacc 6302* Lemma for tfr1on 6310. Each element of  B is an acceptable function. (Contributed by Jim Kingdon, 14-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g
 ( g  Fn  z  /\  g  e.  A  /\  h  =  (
 g  u.  { <. z ,  ( G `  g ) >. } )
 ) }   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( G `  ( g  |`  w ) ) ) )   =>    |-  ( ph  ->  B  C_  A )
 
Theoremtfr1onlembxssdm 6303* Lemma for tfr1on 6310. The union of  B is defined on all elements of  X. (Contributed by Jim Kingdon, 14-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g
 ( g  Fn  z  /\  g  e.  A  /\  h  =  (
 g  u.  { <. z ,  ( G `  g ) >. } )
 ) }   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( G `  ( g  |`  w ) ) ) )   =>    |-  ( ph  ->  D  C_ 
 dom  U. B )
 
Theoremtfr1onlembfn 6304* Lemma for tfr1on 6310. The union of  B is a function defined on  x. (Contributed by Jim Kingdon, 15-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g
 ( g  Fn  z  /\  g  e.  A  /\  h  =  (
 g  u.  { <. z ,  ( G `  g ) >. } )
 ) }   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( G `  ( g  |`  w ) ) ) )   =>    |-  ( ph  ->  U. B  Fn  D )
 
Theoremtfr1onlembex 6305* Lemma for tfr1on 6310. The set  B exists. (Contributed by Jim Kingdon, 14-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g
 ( g  Fn  z  /\  g  e.  A  /\  h  =  (
 g  u.  { <. z ,  ( G `  g ) >. } )
 ) }   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( G `  ( g  |`  w ) ) ) )   =>    |-  ( ph  ->  B  e.  _V )
 
Theoremtfr1onlemubacc 6306* Lemma for tfr1on 6310. The union of  B satisfies the recursion rule. (Contributed by Jim Kingdon, 15-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g
 ( g  Fn  z  /\  g  e.  A  /\  h  =  (
 g  u.  { <. z ,  ( G `  g ) >. } )
 ) }   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( G `  ( g  |`  w ) ) ) )   =>    |-  ( ph  ->  A. u  e.  D  ( U. B `  u )  =  ( G `  ( U. B  |`  u ) ) )
 
Theoremtfr1onlemex 6307* Lemma for tfr1on 6310. (Contributed by Jim Kingdon, 16-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g
 ( g  Fn  z  /\  g  e.  A  /\  h  =  (
 g  u.  { <. z ,  ( G `  g ) >. } )
 ) }   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( G `  ( g  |`  w ) ) ) )   =>    |-  ( ph  ->  E. f
 ( f  Fn  D  /\  A. u  e.  D  ( f `  u )  =  ( G `  ( f  |`  u ) ) ) )
 
Theoremtfr1onlemaccex 6308* We can define an acceptable function on any element of  X.

As with many of the transfinite recursion theorems, we have hypotheses that state that  F is a function and that it is defined up to  X. (Contributed by Jim Kingdon, 16-Mar-2022.)

 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   =>    |-  ( ( ph  /\  C  e.  X )  ->  E. g
 ( g  Fn  C  /\  A. u  e.  C  ( g `  u )  =  ( G `  ( g  |`  u ) ) ) )
 
Theoremtfr1onlemres 6309* Lemma for tfr1on 6310. Recursion is defined on an ordinal if the characteristic function is defined up to a suitable point. (Contributed by Jim Kingdon, 18-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  A  =  { f  |  E. x  e.  X  (
 f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  Y  e.  X )   =>    |-  ( ph  ->  Y  C_ 
 dom  F )
 
Theoremtfr1on 6310* Recursion is defined on an ordinal if the characteristic function is defined up to a suitable point. (Contributed by Jim Kingdon, 12-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f  Fn  x )  ->  ( G `  f )  e.  _V )   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  Y  e.  X )   =>    |-  ( ph  ->  Y  C_ 
 dom  F )
 
Theoremtfri1dALT 6311* Alternate proof of tfri1d 6295 in terms of tfr1on 6310.

Although this does show that the tfr1on 6310 proof is general enough to also prove tfri1d 6295, the tfri1d 6295 proof is simpler in places because it does not need to deal with 
X being any ordinal. For that reason, we have both proofs. (Proof modification is discouraged.) (New usage is discouraged.) (Contributed by Jim Kingdon, 20-Mar-2022.)

 |-  F  = recs ( G )   &    |-  ( ph  ->  A. x ( Fun  G  /\  ( G `  x )  e.  _V )
 )   =>    |-  ( ph  ->  F  Fn  On )
 
Theoremtfrcllemssrecs 6312* Lemma for tfrcl 6324. The union of functions acceptable for tfrcl 6324 is a subset of recs. (Contributed by Jim Kingdon, 25-Mar-2022.)
 |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  ( ph  ->  Ord 
 X )   =>    |-  ( ph  ->  U. A  C_ recs
 ( G ) )
 
Theoremtfrcllemsucfn 6313* We can extend an acceptable function by one element to produce a function. Lemma for tfrcl 6324. (Contributed by Jim Kingdon, 24-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  ( ph  ->  z  e.  X )   &    |-  ( ph  ->  g : z --> S )   &    |-  ( ph  ->  g  e.  A )   =>    |-  ( ph  ->  ( g  u.  { <. z ,  ( G `  g ) >. } ) : suc  z --> S )
 
Theoremtfrcllemsucaccv 6314* Lemma for tfrcl 6324. We can extend an acceptable function by one element to produce an acceptable function. (Contributed by Jim Kingdon, 24-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  ( ph  ->  Y  e.  X )   &    |-  ( ph  ->  z  e.  Y )   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  g :
 z --> S )   &    |-  ( ph  ->  g  e.  A )   =>    |-  ( ph  ->  (
 g  u.  { <. z ,  ( G `  g ) >. } )  e.  A )
 
Theoremtfrcllembacc 6315* Lemma for tfrcl 6324. Each element of  B is an acceptable function. (Contributed by Jim Kingdon, 25-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `  g ) >. } ) ) }   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g : z --> S  /\  A. w  e.  z  (
 g `  w )  =  ( G `  (
 g  |`  w ) ) ) )   =>    |-  ( ph  ->  B  C_  A )
 
Theoremtfrcllembxssdm 6316* Lemma for tfrcl 6324. The union of  B is defined on all elements of  X. (Contributed by Jim Kingdon, 25-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `  g ) >. } ) ) }   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g : z --> S  /\  A. w  e.  z  (
 g `  w )  =  ( G `  (
 g  |`  w ) ) ) )   =>    |-  ( ph  ->  D  C_ 
 dom  U. B )
 
Theoremtfrcllembfn 6317* Lemma for tfrcl 6324. The union of  B is a function defined on  x. (Contributed by Jim Kingdon, 25-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `  g ) >. } ) ) }   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g : z --> S  /\  A. w  e.  z  (
 g `  w )  =  ( G `  (
 g  |`  w ) ) ) )   =>    |-  ( ph  ->  U. B : D --> S )
 
Theoremtfrcllembex 6318* Lemma for tfrcl 6324. The set  B exists. (Contributed by Jim Kingdon, 25-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `  g ) >. } ) ) }   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g : z --> S  /\  A. w  e.  z  (
 g `  w )  =  ( G `  (
 g  |`  w ) ) ) )   =>    |-  ( ph  ->  B  e.  _V )
 
Theoremtfrcllemubacc 6319* Lemma for tfrcl 6324. The union of  B satisfies the recursion rule. (Contributed by Jim Kingdon, 25-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `  g ) >. } ) ) }   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g : z --> S  /\  A. w  e.  z  (
 g `  w )  =  ( G `  (
 g  |`  w ) ) ) )   =>    |-  ( ph  ->  A. u  e.  D  ( U. B `  u )  =  ( G `  ( U. B  |`  u ) ) )
 
Theoremtfrcllemex 6320* Lemma for tfrcl 6324. (Contributed by Jim Kingdon, 26-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  B  =  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `  g ) >. } ) ) }   &    |-  (
 ( ph  /\  x  e. 
 U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  D  e.  X )   &    |-  ( ph  ->  A. z  e.  D  E. g ( g : z --> S  /\  A. w  e.  z  (
 g `  w )  =  ( G `  (
 g  |`  w ) ) ) )   =>    |-  ( ph  ->  E. f
 ( f : D --> S  /\  A. u  e.  D  ( f `  u )  =  ( G `  ( f  |`  u ) ) ) )
 
Theoremtfrcllemaccex 6321* We can define an acceptable function on any element of  X.

As with many of the transfinite recursion theorems, we have hypotheses that state that  F is a function and that it is defined up to  X. (Contributed by Jim Kingdon, 26-Mar-2022.)

 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   =>    |-  ( ( ph  /\  C  e.  X )  ->  E. g
 ( g : C --> S  /\  A. u  e.  C  ( g `  u )  =  ( G `  ( g  |`  u ) ) ) )
 
Theoremtfrcllemres 6322* Lemma for tfr1on 6310. Recursion is defined on an ordinal if the characteristic function is defined up to a suitable point. (Contributed by Jim Kingdon, 18-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  A  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  Y  e.  X )   =>    |-  ( ph  ->  Y 
 C_  dom  F )
 
Theoremtfrcldm 6323* Recursion is defined on an ordinal if the characteristic function satisfies a closure hypothesis up to a suitable point. (Contributed by Jim Kingdon, 26-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  Y  e.  U. X )   =>    |-  ( ph  ->  Y  e.  dom  F )
 
Theoremtfrcl 6324* Closure for transfinite recursion. As with tfr1on 6310, the characteristic function must be defined up to a suitable point, not necessarily on all ordinals. (Contributed by Jim Kingdon, 25-Mar-2022.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  Fun 
 G )   &    |-  ( ph  ->  Ord 
 X )   &    |-  ( ( ph  /\  x  e.  X  /\  f : x --> S ) 
 ->  ( G `  f
 )  e.  S )   &    |-  ( ( ph  /\  x  e.  U. X )  ->  suc  x  e.  X )   &    |-  ( ph  ->  Y  e.  U. X )   =>    |-  ( ph  ->  ( F `  Y )  e.  S )
 
Theoremtfri1 6325* Principle of Transfinite Recursion, part 1 of 3. Theorem 7.41(1) of [TakeutiZaring] p. 47, with an additional condition.

The condition is that  G is defined "everywhere", which is stated here as  ( G `  x )  e.  _V. Alternately,  A. x  e.  On A. f ( f  Fn  x  -> 
f  e.  dom  G
) would suffice.

Given a function  G satisfying that condition, we define a class  A of all "acceptable" functions. The final function we're interested in is the union 
F  = recs ( G ) of them.  F is then said to be defined by transfinite recursion. The purpose of the 3 parts of this theorem is to demonstrate properties of  F. In this first part we show that  F is a function whose domain is all ordinal numbers. (Contributed by Jim Kingdon, 4-May-2019.) (Revised by Mario Carneiro, 24-May-2019.)

 |-  F  = recs ( G )   &    |-  ( Fun  G  /\  ( G `  x )  e.  _V )   =>    |-  F  Fn  On
 
Theoremtfri2 6326* Principle of Transfinite Recursion, part 2 of 3. Theorem 7.41(2) of [TakeutiZaring] p. 47, with an additional condition on the recursion rule  G ( as described at tfri1 6325). Here we show that the function  F has the property that for any function  G satisfying that condition, the "next" value of  F is  G recursively applied to all "previous" values of  F. (Contributed by Jim Kingdon, 4-May-2019.)
 |-  F  = recs ( G )   &    |-  ( Fun  G  /\  ( G `  x )  e.  _V )   =>    |-  ( A  e.  On  ->  ( F `  A )  =  ( G `  ( F  |`  A ) ) )
 
Theoremtfri3 6327* Principle of Transfinite Recursion, part 3 of 3. Theorem 7.41(3) of [TakeutiZaring] p. 47, with an additional condition on the recursion rule  G ( as described at tfri1 6325). Finally, we show that  F is unique. We do this by showing that any class  B with the same properties of  F that we showed in parts 1 and 2 is identical to  F. (Contributed by Jim Kingdon, 4-May-2019.)
 |-  F  = recs ( G )   &    |-  ( Fun  G  /\  ( G `  x )  e.  _V )   =>    |-  (
 ( B  Fn  On  /\ 
 A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  B  =  F )
 
Theoremtfrex 6328* The transfinite recursion function is set-like if the input is. (Contributed by Mario Carneiro, 3-Jul-2019.)
 |-  F  = recs ( G )   &    |-  ( ph  ->  A. x ( Fun  G  /\  ( G `  x )  e.  _V )
 )   =>    |-  ( ( ph  /\  A  e.  V )  ->  ( F `  A )  e. 
 _V )
 
2.6.21  Recursive definition generator
 
Syntaxcrdg 6329 Extend class notation with the recursive definition generator, with characteristic function  F and initial value  I.
 class  rec ( F ,  I
 )
 
Definitiondf-irdg 6330* Define a recursive definition generator on  On (the class of ordinal numbers) with characteristic function  F and initial value  I. This rather amazing operation allows us to define, with compact direct definitions, functions that are usually defined in textbooks only with indirect self-referencing recursive definitions. A recursive definition requires advanced metalogic to justify - in particular, eliminating a recursive definition is very difficult and often not even shown in textbooks. On the other hand, the elimination of a direct definition is a matter of simple mechanical substitution. The price paid is the daunting complexity of our 
rec operation (especially when df-recs 6265 that it is built on is also eliminated). But once we get past this hurdle, definitions that would otherwise be recursive become relatively simple. In classical logic it would be easier to divide this definition into cases based on whether the domain of  g is zero, a successor, or a limit ordinal. Cases do not (in general) work that way in intuitionistic logic, so instead we choose a definition which takes the union of all the results of the characteristic function for ordinals in the domain of  g. This means that this definition has the expected properties for increasing and continuous ordinal functions, which include ordinal addition and multiplication.

For finite recursion we also define df-frec 6351 and for suitable characteristic functions df-frec 6351 yields the same result as  rec restricted to  om, as seen at frecrdg 6368.

Note: We introduce 
rec with the philosophical goal of being able to eliminate all definitions with direct mechanical substitution and to verify easily the soundness of definitions. Metamath itself has no built-in technical limitation that prevents multiple-part recursive definitions in the traditional textbook style. (Contributed by Jim Kingdon, 19-May-2019.)

 |- 
 rec ( F ,  I )  = recs (
 ( g  e.  _V  |->  ( I  u.  U_ x  e.  dom  g ( F `
  ( g `  x ) ) ) ) )
 
Theoremrdgeq1 6331 Equality theorem for the recursive definition generator. (Contributed by NM, 9-Apr-1995.) (Revised by Mario Carneiro, 9-May-2015.)
 |-  ( F  =  G  ->  rec ( F ,  A )  =  rec ( G ,  A ) )
 
Theoremrdgeq2 6332 Equality theorem for the recursive definition generator. (Contributed by NM, 9-Apr-1995.) (Revised by Mario Carneiro, 9-May-2015.)
 |-  ( A  =  B  ->  rec ( F ,  A )  =  rec ( F ,  B ) )
 
Theoremrdgfun 6333 The recursive definition generator is a function. (Contributed by Mario Carneiro, 16-Nov-2014.)
 |- 
 Fun  rec ( F ,  A )
 
Theoremrdgtfr 6334* The recursion rule for the recursive definition generator is defined everywhere. (Contributed by Jim Kingdon, 14-May-2020.)
 |-  ( ( A. z
 ( F `  z
 )  e.  _V  /\  A  e.  V )  ->  ( Fun  ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `  ( g `  x ) ) ) ) 
 /\  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `  ( g `  x ) ) ) ) `
  f )  e. 
 _V ) )
 
Theoremrdgruledefgg 6335* The recursion rule for the recursive definition generator is defined everywhere. (Contributed by Jim Kingdon, 4-Jul-2019.)
 |-  ( ( F  Fn  _V 
 /\  A  e.  V )  ->  ( Fun  (
 g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
  ( g `  x ) ) ) )  /\  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
  ( g `  x ) ) ) ) `  f )  e.  _V ) )
 
Theoremrdgruledefg 6336* The recursion rule for the recursive definition generator is defined everywhere. (Contributed by Jim Kingdon, 4-Jul-2019.)
 |-  F  Fn  _V   =>    |-  ( A  e.  V  ->  ( Fun  (
 g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
  ( g `  x ) ) ) )  /\  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
  ( g `  x ) ) ) ) `  f )  e.  _V ) )
 
Theoremrdgexggg 6337 The recursive definition generator produces a set on a set input. (Contributed by Jim Kingdon, 4-Jul-2019.)
 |-  ( ( F  Fn  _V 
 /\  A  e.  V  /\  B  e.  W ) 
 ->  ( rec ( F ,  A ) `  B )  e.  _V )
 
Theoremrdgexgg 6338 The recursive definition generator produces a set on a set input. (Contributed by Jim Kingdon, 4-Jul-2019.)
 |-  F  Fn  _V   =>    |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( rec ( F ,  A ) `  B )  e. 
 _V )
 
Theoremrdgifnon 6339 The recursive definition generator is a function on ordinal numbers. The  F  Fn  _V condition states that the characteristic function is defined for all sets (being defined for all ordinals might be enough if being used in a manner similar to rdgon 6346; in cases like df-oadd 6380 either presumably could work). (Contributed by Jim Kingdon, 13-Jul-2019.)
 |-  ( ( F  Fn  _V 
 /\  A  e.  V )  ->  rec ( F ,  A )  Fn  On )
 
Theoremrdgifnon2 6340* The recursive definition generator is a function on ordinal numbers. (Contributed by Jim Kingdon, 14-May-2020.)
 |-  ( ( A. z
 ( F `  z
 )  e.  _V  /\  A  e.  V )  ->  rec ( F ,  A )  Fn  On )
 
Theoremrdgivallem 6341* Value of the recursive definition generator. Lemma for rdgival 6342 which simplifies the value further. (Contributed by Jim Kingdon, 13-Jul-2019.) (New usage is discouraged.)
 |-  ( ( F  Fn  _V 
 /\  A  e.  V  /\  B  e.  On )  ->  ( rec ( F ,  A ) `  B )  =  ( A  u.  U_ x  e.  B  ( F `  ( ( rec ( F ,  A )  |`  B ) `
  x ) ) ) )
 
Theoremrdgival 6342* Value of the recursive definition generator. (Contributed by Jim Kingdon, 26-Jul-2019.)
 |-  ( ( F  Fn  _V 
 /\  A  e.  V  /\  B  e.  On )  ->  ( rec ( F ,  A ) `  B )  =  ( A  u.  U_ x  e.  B  ( F `  ( rec ( F ,  A ) `  x ) ) ) )
 
Theoremrdgss 6343 Subset and recursive definition generator. (Contributed by Jim Kingdon, 15-Jul-2019.)
 |-  ( ph  ->  F  Fn  _V )   &    |-  ( ph  ->  I  e.  V )   &    |-  ( ph  ->  A  e.  On )   &    |-  ( ph  ->  B  e.  On )   &    |-  ( ph  ->  A 
 C_  B )   =>    |-  ( ph  ->  ( rec ( F ,  I ) `  A )  C_  ( rec ( F ,  I ) `  B ) )
 
Theoremrdgisuc1 6344* One way of describing the value of the recursive definition generator at a successor. There is no condition on the characteristic function  F other than  F  Fn  _V. Given that, the resulting expression encompasses both the expected successor term  ( F `  ( rec ( F ,  A ) `  B
) ) but also terms that correspond to the initial value  A and to limit ordinals  U_ x  e.  B ( F `  ( rec ( F ,  A ) `  x
) ).

If we add conditions on the characteristic function, we can show tighter results such as rdgisucinc 6345. (Contributed by Jim Kingdon, 9-Jun-2019.)

 |-  ( ph  ->  F  Fn  _V )   &    |-  ( ph  ->  A  e.  V )   &    |-  ( ph  ->  B  e.  On )   =>    |-  ( ph  ->  ( rec ( F ,  A ) `  suc  B )  =  ( A  u.  ( U_ x  e.  B  ( F `  ( rec ( F ,  A ) `  x ) )  u.  ( F `  ( rec ( F ,  A ) `  B ) ) ) ) )
 
Theoremrdgisucinc 6345* Value of the recursive definition generator at a successor.

This can be thought of as a generalization of oasuc 6424 and omsuc 6432. (Contributed by Jim Kingdon, 29-Aug-2019.)

 |-  ( ph  ->  F  Fn  _V )   &    |-  ( ph  ->  A  e.  V )   &    |-  ( ph  ->  B  e.  On )   &    |-  ( ph  ->  A. x  x  C_  ( F `  x ) )   =>    |-  ( ph  ->  ( rec ( F ,  A ) `  suc  B )  =  ( F `
  ( rec ( F ,  A ) `  B ) ) )
 
Theoremrdgon 6346* Evaluating the recursive definition generator produces an ordinal. There is a hypothesis that the characteristic function produces ordinals on ordinal arguments. (Contributed by Jim Kingdon, 26-Jul-2019.) (Revised by Jim Kingdon, 13-Apr-2022.)
 |-  ( ph  ->  A  e.  On )   &    |-  ( ph  ->  A. x  e.  On  ( F `  x )  e. 
 On )   =>    |-  ( ( ph  /\  B  e.  On )  ->  ( rec ( F ,  A ) `  B )  e. 
 On )
 
Theoremrdg0 6347 The initial value of the recursive definition generator. (Contributed by NM, 23-Apr-1995.) (Revised by Mario Carneiro, 14-Nov-2014.)
 |-  A  e.  _V   =>    |-  ( rec ( F ,  A ) `  (/) )  =  A
 
Theoremrdg0g 6348 The initial value of the recursive definition generator. (Contributed by NM, 25-Apr-1995.)
 |-  ( A  e.  C  ->  ( rec ( F ,  A ) `  (/) )  =  A )
 
Theoremrdgexg 6349 The recursive definition generator produces a set on a set input. (Contributed by Mario Carneiro, 3-Jul-2019.)
 |-  A  e.  _V   &    |-  F  Fn  _V   =>    |-  ( B  e.  V  ->  ( rec ( F ,  A ) `  B )  e.  _V )
 
2.6.22  Finite recursion
 
Syntaxcfrec 6350 Extend class notation with the finite recursive definition generator, with characteristic function  F and initial value  I.
 class frec ( F ,  I )
 
Definitiondf-frec 6351* Define a recursive definition generator on  om (the class of finite ordinals) with characteristic function  F and initial value  I. This rather amazing operation allows us to define, with compact direct definitions, functions that are usually defined in textbooks only with indirect self-referencing recursive definitions. A recursive definition requires advanced metalogic to justify - in particular, eliminating a recursive definition is very difficult and often not even shown in textbooks. On the other hand, the elimination of a direct definition is a matter of simple mechanical substitution. The price paid is the daunting complexity of our frec operation (especially when df-recs 6265 that it is built on is also eliminated). But once we get past this hurdle, definitions that would otherwise be recursive become relatively simple; see frec0g 6357 and frecsuc 6367.

Unlike with transfinite recursion, finite recurson can readily divide definitions and proofs into zero and successor cases, because even without excluded middle we have theorems such as nn0suc 4576. The analogous situation with transfinite recursion - being able to say that an ordinal is zero, successor, or limit - is enabled by excluded middle and thus is not available to us. For the characteristic functions which satisfy the conditions given at frecrdg 6368, this definition and df-irdg 6330 restricted to  om produce the same result.

Note: We introduce frec with the philosophical goal of being able to eliminate all definitions with direct mechanical substitution and to verify easily the soundness of definitions. Metamath itself has no built-in technical limitation that prevents multiple-part recursive definitions in the traditional textbook style. (Contributed by Mario Carneiro and Jim Kingdon, 10-Aug-2019.)

 |- frec
 ( F ,  I
 )  =  (recs (
 ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `  m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  I ) ) }
 ) )  |`  om )
 
Theoremfreceq1 6352 Equality theorem for the finite recursive definition generator. (Contributed by Jim Kingdon, 30-May-2020.)
 |-  ( F  =  G  -> frec ( F ,  A )  = frec ( G ,  A ) )
 
Theoremfreceq2 6353 Equality theorem for the finite recursive definition generator. (Contributed by Jim Kingdon, 30-May-2020.)
 |-  ( A  =  B  -> frec ( F ,  A )  = frec ( F ,  B ) )
 
Theoremfrecex 6354 Finite recursion produces a set. (Contributed by Jim Kingdon, 20-Aug-2021.)
 |- frec
 ( F ,  A )  e.  _V
 
Theoremfrecfun 6355 Finite recursion produces a function. See also frecfnom 6361 which also states that the domain of that function is  om but which puts conditions on  A and  F. (Contributed by Jim Kingdon, 13-Feb-2022.)
 |- 
 Fun frec ( F ,  A )
 
Theoremnffrec 6356 Bound-variable hypothesis builder for the finite recursive definition generator. (Contributed by Jim Kingdon, 30-May-2020.)
 |-  F/_ x F   &    |-  F/_ x A   =>    |-  F/_ xfrec ( F ,  A )
 
Theoremfrec0g 6357 The initial value resulting from finite recursive definition generation. (Contributed by Jim Kingdon, 7-May-2020.)
 |-  ( A  e.  V  ->  (frec ( F ,  A ) `  (/) )  =  A )
 
Theoremfrecabex 6358* The class abstraction from df-frec 6351 exists. This is a lemma for other finite recursion proofs. (Contributed by Jim Kingdon, 13-May-2020.)
 |-  ( ph  ->  S  e.  V )   &    |-  ( ph  ->  A. y ( F `  y )  e.  _V )   &    |-  ( ph  ->  A  e.  W )   =>    |-  ( ph  ->  { x  |  ( E. m  e. 
 om  ( dom  S  =  suc  m  /\  x  e.  ( F `  ( S `  m ) ) )  \/  ( dom 
 S  =  (/)  /\  x  e.  A ) ) }  e.  _V )
 
Theoremfrecabcl 6359* The class abstraction from df-frec 6351 exists. Unlike frecabex 6358 the function  F only needs to be defined on  S, not all sets. This is a lemma for other finite recursion proofs. (Contributed by Jim Kingdon, 21-Mar-2022.)
 |-  ( ph  ->  N  e.  om )   &    |-  ( ph  ->  G : N --> S )   &    |-  ( ph  ->  A. y  e.  S  ( F `  y )  e.  S )   &    |-  ( ph  ->  A  e.  S )   =>    |-  ( ph  ->  { x  |  ( E. m  e. 
 om  ( dom  G  =  suc  m  /\  x  e.  ( F `  ( G `  m ) ) )  \/  ( dom 
 G  =  (/)  /\  x  e.  A ) ) }  e.  S )
 
Theoremfrectfr 6360* Lemma to connect transfinite recursion theorems with finite recursion. That is, given the conditions  F  Fn  _V and  A  e.  V on frec ( F ,  A ), we want to be able to apply tfri1d 6295 or tfri2d 6296, and this lemma lets us satisfy hypotheses of those theorems.

(Contributed by Jim Kingdon, 15-Aug-2019.)

 |-  G  =  ( g  e.  _V  |->  { x  |  ( E. m  e. 
 om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
 g `  m )
 ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) }
 )   =>    |-  ( ( A. z
 ( F `  z
 )  e.  _V  /\  A  e.  V )  ->  A. y ( Fun 
 G  /\  ( G `  y )  e.  _V ) )
 
Theoremfrecfnom 6361* The function generated by finite recursive definition generation is a function on omega. (Contributed by Jim Kingdon, 13-May-2020.)
 |-  ( ( A. z
 ( F `  z
 )  e.  _V  /\  A  e.  V )  -> frec ( F ,  A )  Fn  om )
 
Theoremfreccllem 6362* Lemma for freccl 6363. Just giving a name to a common expression to simplify the proof. (Contributed by Jim Kingdon, 27-Mar-2022.)
 |-  ( ph  ->  A  e.  S )   &    |-  ( ( ph  /\  z  e.  S ) 
 ->  ( F `  z
 )  e.  S )   &    |-  ( ph  ->  B  e.  om )   &    |-  G  = recs (
 ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `  m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) }
 ) )   =>    |-  ( ph  ->  (frec ( F ,  A ) `
  B )  e.  S )
 
Theoremfreccl 6363* Closure for finite recursion. (Contributed by Jim Kingdon, 27-Mar-2022.)
 |-  ( ph  ->  A  e.  S )   &    |-  ( ( ph  /\  z  e.  S ) 
 ->  ( F `  z
 )  e.  S )   &    |-  ( ph  ->  B  e.  om )   =>    |-  ( ph  ->  (frec ( F ,  A ) `
  B )  e.  S )
 
Theoremfrecfcllem 6364* Lemma for frecfcl 6365. Just giving a name to a common expression to simplify the proof. (Contributed by Jim Kingdon, 30-Mar-2022.)
 |-  G  = recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `  m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) }
 ) )   =>    |-  ( ( A. z  e.  S  ( F `  z )  e.  S  /\  A  e.  S ) 
 -> frec ( F ,  A ) : om --> S )
 
Theoremfrecfcl 6365* Finite recursion yields a function on the natural numbers. (Contributed by Jim Kingdon, 30-Mar-2022.)
 |-  ( ( A. z  e.  S  ( F `  z )  e.  S  /\  A  e.  S ) 
 -> frec ( F ,  A ) : om --> S )
 
Theoremfrecsuclem 6366* Lemma for frecsuc 6367. Just giving a name to a common expression to simplify the proof. (Contributed by Jim Kingdon, 29-Mar-2022.)
 |-  G  =  ( g  e.  _V  |->  { x  |  ( E. m  e. 
 om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
 g `  m )
 ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) }
 )   =>    |-  ( ( A. z  e.  S  ( F `  z )  e.  S  /\  A  e.  S  /\  B  e.  om )  ->  (frec ( F ,  A ) `  suc  B )  =  ( F `
  (frec ( F ,  A ) `  B ) ) )
 
Theoremfrecsuc 6367* The successor value resulting from finite recursive definition generation. (Contributed by Jim Kingdon, 31-Mar-2022.)
 |-  ( ( A. z  e.  S  ( F `  z )  e.  S  /\  A  e.  S  /\  B  e.  om )  ->  (frec ( F ,  A ) `  suc  B )  =  ( F `
  (frec ( F ,  A ) `  B ) ) )
 
Theoremfrecrdg 6368* Transfinite recursion restricted to omega.

Given a suitable characteristic function, df-frec 6351 produces the same results as df-irdg 6330 restricted to  om.

Presumably the theorem would also hold if  F  Fn  _V were changed to  A. z ( F `  z )  e.  _V. (Contributed by Jim Kingdon, 29-Aug-2019.)

 |-  ( ph  ->  F  Fn  _V )   &    |-  ( ph  ->  A  e.  V )   &    |-  ( ph  ->  A. x  x  C_  ( F `  x ) )   =>    |-  ( ph  -> frec ( F ,  A )  =  ( rec ( F ,  A )  |`  om ) )
 
2.6.23  Ordinal arithmetic
 
Syntaxc1o 6369 Extend the definition of a class to include the ordinal number 1.
 class  1o
 
Syntaxc2o 6370 Extend the definition of a class to include the ordinal number 2.
 class  2o
 
Syntaxc3o 6371 Extend the definition of a class to include the ordinal number 3.
 class  3o
 
Syntaxc4o 6372 Extend the definition of a class to include the ordinal number 4.
 class  4o
 
Syntaxcoa 6373 Extend the definition of a class to include the ordinal addition operation.
 class  +o
 
Syntaxcomu 6374 Extend the definition of a class to include the ordinal multiplication operation.
 class  .o
 
Syntaxcoei 6375 Extend the definition of a class to include the ordinal exponentiation operation.
 classo
 
Definitiondf-1o 6376 Define the ordinal number 1. (Contributed by NM, 29-Oct-1995.)
 |- 
 1o  =  suc  (/)
 
Definitiondf-2o 6377 Define the ordinal number 2. (Contributed by NM, 18-Feb-2004.)
 |- 
 2o  =  suc  1o
 
Definitiondf-3o 6378 Define the ordinal number 3. (Contributed by Mario Carneiro, 14-Jul-2013.)
 |- 
 3o  =  suc  2o
 
Definitiondf-4o 6379 Define the ordinal number 4. (Contributed by Mario Carneiro, 14-Jul-2013.)
 |- 
 4o  =  suc  3o
 
Definitiondf-oadd 6380* Define the ordinal addition operation. (Contributed by NM, 3-May-1995.)
 |- 
 +o  =  ( x  e.  On ,  y  e.  On  |->  ( rec (
 ( z  e.  _V  |->  suc  z ) ,  x ) `  y ) )
 
Definitiondf-omul 6381* Define the ordinal multiplication operation. (Contributed by NM, 26-Aug-1995.)
 |- 
 .o  =  ( x  e.  On ,  y  e.  On  |->  ( rec (
 ( z  e.  _V  |->  ( z  +o  x ) ) ,  (/) ) `  y ) )
 
Definitiondf-oexpi 6382* Define the ordinal exponentiation operation.

This definition is similar to a conventional definition of exponentiation except that it defines  (/)o  A to be  1o for all  A  e.  On, in order to avoid having different cases for whether the base is  (/) or not. (Contributed by Mario Carneiro, 4-Jul-2019.)

 |-o  =  ( x  e.  On ,  y  e.  On  |->  ( rec ( ( z  e.  _V  |->  ( z  .o  x ) ) ,  1o ) `  y ) )
 
Theorem1on 6383 Ordinal 1 is an ordinal number. (Contributed by NM, 29-Oct-1995.)
 |- 
 1o  e.  On
 
Theorem1oex 6384 Ordinal 1 is a set. (Contributed by BJ, 4-Jul-2022.)
 |- 
 1o  e.  _V
 
Theorem2on 6385 Ordinal 2 is an ordinal number. (Contributed by NM, 18-Feb-2004.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)
 |- 
 2o  e.  On
 
Theorem2on0 6386 Ordinal two is not zero. (Contributed by Scott Fenton, 17-Jun-2011.)
 |- 
 2o  =/=  (/)
 
Theorem3on 6387 Ordinal 3 is an ordinal number. (Contributed by Mario Carneiro, 5-Jan-2016.)
 |- 
 3o  e.  On
 
Theorem4on 6388 Ordinal 3 is an ordinal number. (Contributed by Mario Carneiro, 5-Jan-2016.)
 |- 
 4o  e.  On
 
Theoremdf1o2 6389 Expanded value of the ordinal number 1. (Contributed by NM, 4-Nov-2002.)
 |- 
 1o  =  { (/) }
 
Theoremdf2o3 6390 Expanded value of the ordinal number 2. (Contributed by Mario Carneiro, 14-Aug-2015.)
 |- 
 2o  =  { (/) ,  1o }
 
Theoremdf2o2 6391 Expanded value of the ordinal number 2. (Contributed by NM, 29-Jan-2004.)
 |- 
 2o  =  { (/) ,  { (/)
 } }
 
Theorem1n0 6392 Ordinal one is not equal to ordinal zero. (Contributed by NM, 26-Dec-2004.)
 |- 
 1o  =/=  (/)
 
Theoremxp01disj 6393 Cartesian products with the singletons of ordinals 0 and 1 are disjoint. (Contributed by NM, 2-Jun-2007.)
 |-  ( ( A  X.  { (/) } )  i^i  ( C  X.  { 1o }
 ) )  =  (/)
 
Theoremxp01disjl 6394 Cartesian products with the singletons of ordinals 0 and 1 are disjoint. (Contributed by Jim Kingdon, 11-Jul-2023.)
 |-  ( ( { (/) }  X.  A )  i^i  ( { 1o }  X.  C ) )  =  (/)
 
Theoremordgt0ge1 6395 Two ways to express that an ordinal class is positive. (Contributed by NM, 21-Dec-2004.)
 |-  ( Ord  A  ->  ( (/)  e.  A  <->  1o  C_  A ) )
 
Theoremordge1n0im 6396 An ordinal greater than or equal to 1 is nonzero. (Contributed by Jim Kingdon, 26-Jun-2019.)
 |-  ( Ord  A  ->  ( 1o  C_  A  ->  A  =/=  (/) ) )
 
Theoremel1o 6397 Membership in ordinal one. (Contributed by NM, 5-Jan-2005.)
 |-  ( A  e.  1o  <->  A  =  (/) )
 
Theoremdif1o 6398 Two ways to say that  A is a nonzero number of the set  B. (Contributed by Mario Carneiro, 21-May-2015.)
 |-  ( A  e.  ( B  \  1o )  <->  ( A  e.  B  /\  A  =/=  (/) ) )
 
Theorem2oconcl 6399 Closure of the pair swapping function on  2o. (Contributed by Mario Carneiro, 27-Sep-2015.)
 |-  ( A  e.  2o  ->  ( 1o  \  A )  e.  2o )
 
Theorem0lt1o 6400 Ordinal zero is less than ordinal one. (Contributed by NM, 5-Jan-2005.)
 |-  (/)  e.  1o
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13822
  Copyright terms: Public domain < Previous  Next >