P. 66 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 6501-6600   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	tfri1d 6501*	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 )   &    |- ( ph -> A. x ( Fun G /\ ( G ` x ) e. _V ) )   =>    |- ( ph -> F Fn On )
Theorem	tfri2d 6502*	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 6531). 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 )   &    |- ( ph -> A. x ( Fun G /\ ( G ` x ) e. _V ) )   =>    |- ( ( ph /\ A e. On ) -> ( F ` A ) = ( G ` ( F |` A ) ) )
Theorem	tfr1onlem3ag 6503*	Lemma for transfinite recursion. This lemma changes some bound variables in A (version of tfrlem3ag 6475 but for tfr1on 6516 related lemmas). (Contributed by Jim Kingdon, 13-Mar-2022.)
|- A = { f | E. x e. X ( f Fn x /\ A. y e. x ( f ` y ) = ( G ` ( f |` y ) ) ) }   =>    |- ( H e. V -> ( H e. A <-> E. z e. X ( H Fn z /\ A. w e. z ( H ` w ) = ( G ` ( H |` w ) ) ) ) )
Theorem	tfr1onlem3 6504*	Lemma for transfinite recursion. This lemma changes some bound variables in A (version of tfrlem3 6477 but for tfr1on 6516 related lemmas). (Contributed by Jim Kingdon, 14-Mar-2022.)
|- A = { f | E. x e. X ( f Fn x /\ A. y e. x ( f ` y ) = ( G ` ( f |` y ) ) ) }   =>    |- A = { g | E. z e. X ( g Fn z /\ A. w e. z ( g ` w ) = ( G ` ( g |` w ) ) ) }
Theorem	tfr1onlemssrecs 6505*	Lemma for tfr1on 6516. The union of functions acceptable for tfr1on 6516 is a subset of recs. (Contributed by Jim Kingdon, 15-Mar-2022.)
|- A = { f | E. x e. X ( f Fn x /\ A. y e. x ( f ` y ) = ( G ` ( f |` y ) ) ) }   &    |- ( ph -> Ord X )   =>    |- ( ph -> U. A C_ recs ( G ) )
Theorem	tfr1onlemsucfn 6506*	We can extend an acceptable function by one element to produce a function. Lemma for tfr1on 6516. (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 -> z e. X )   &    |- ( ph -> g Fn z )   &    |- ( ph -> g e. A )   =>    |- ( ph -> ( g u. { <. z , ( G ` g ) >. } ) Fn suc z )
Theorem	tfr1onlemsucaccv 6507*	Lemma for tfr1on 6516. 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 )
Theorem	tfr1onlembacc 6508*	Lemma for tfr1on 6516. 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 )
Theorem	tfr1onlembxssdm 6509*	Lemma for tfr1on 6516. 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 )
Theorem	tfr1onlembfn 6510*	Lemma for tfr1on 6516. 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 )
Theorem	tfr1onlembex 6511*	Lemma for tfr1on 6516. 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 )
Theorem	tfr1onlemubacc 6512*	Lemma for tfr1on 6516. 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 ) ) )
Theorem	tfr1onlemex 6513*	Lemma for tfr1on 6516. (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 ) ) ) )
Theorem	tfr1onlemaccex 6514*	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 ) ) ) )
Theorem	tfr1onlemres 6515*	Lemma for tfr1on 6516. 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 )
Theorem	tfr1on 6516*	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 )
Theorem	tfri1dALT 6517*	Alternate proof of tfri1d 6501 in terms of tfr1on 6516. Although this does show that the tfr1on 6516 proof is general enough to also prove tfri1d 6501, the tfri1d 6501 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 )
Theorem	tfrcllemssrecs 6518*	Lemma for tfrcl 6530. The union of functions acceptable for tfrcl 6530 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 ) )
Theorem	tfrcllemsucfn 6519*	We can extend an acceptable function by one element to produce a function. Lemma for tfrcl 6530. (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 )
Theorem	tfrcllemsucaccv 6520*	Lemma for tfrcl 6530. 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 )
Theorem	tfrcllembacc 6521*	Lemma for tfrcl 6530. 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 )
Theorem	tfrcllembxssdm 6522*	Lemma for tfrcl 6530. 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 )
Theorem	tfrcllembfn 6523*	Lemma for tfrcl 6530. 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 )
Theorem	tfrcllembex 6524*	Lemma for tfrcl 6530. 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 )
Theorem	tfrcllemubacc 6525*	Lemma for tfrcl 6530. 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 ) ) )
Theorem	tfrcllemex 6526*	Lemma for tfrcl 6530. (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 ) ) ) )
Theorem	tfrcllemaccex 6527*	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 ) ) ) )
Theorem	tfrcllemres 6528*	Lemma for tfr1on 6516. 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 )
Theorem	tfrcldm 6529*	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 )
Theorem	tfrcl 6530*	Closure for transfinite recursion. As with tfr1on 6516, 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 )
Theorem	tfri1 6531*	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
Theorem	tfri2 6532*	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 6531). 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 ) ) )
Theorem	tfri3 6533*	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 6531). 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 )
Theorem	tfrex 6534*	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
Syntax	crdg 6535	Extend class notation with the recursive definition generator, with characteristic function F and initial value I.
class rec ( F , I )
Definition	df-irdg 6536*	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 6471 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 6557 and for suitable characteristic functions df-frec 6557 yields the same result as rec restricted to om, as seen at frecrdg 6574. 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 ) ) ) ) )
Theorem	rdgeq1 6537	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 ) )
Theorem	rdgeq2 6538	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 ) )
Theorem	rdgfun 6539	The recursive definition generator is a function. (Contributed by Mario Carneiro, 16-Nov-2014.)
|- Fun rec ( F , A )
Theorem	rdgtfr 6540*	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 ) )
Theorem	rdgruledefgg 6541*	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 ) )
Theorem	rdgruledefg 6542*	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 ) )
Theorem	rdgexggg 6543	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 )
Theorem	rdgexgg 6544	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 )
Theorem	rdgifnon 6545	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 6552; in cases like df-oadd 6586 either presumably could work). (Contributed by Jim Kingdon, 13-Jul-2019.)
|- ( ( F Fn _V /\ A e. V ) -> rec ( F , A ) Fn On )
Theorem	rdgifnon2 6546*	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 )
Theorem	rdgivallem 6547*	Value of the recursive definition generator. Lemma for rdgival 6548 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 ) ) ) )
Theorem	rdgival 6548*	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 ) ) ) )
Theorem	rdgss 6549	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 ) )
Theorem	rdgisuc1 6550*	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 6551. (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 ) ) ) ) )
Theorem	rdgisucinc 6551*	Value of the recursive definition generator at a successor. This can be thought of as a generalization of oasuc 6632 and omsuc 6640. (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 ) ) )
Theorem	rdgon 6552*	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 )
Theorem	rdg0 6553	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
Theorem	rdg0g 6554	The initial value of the recursive definition generator. (Contributed by NM, 25-Apr-1995.)
|- ( A e. C -> ( rec ( F , A ) ` (/) ) = A )
Theorem	rdgexg 6555	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
Syntax	cfrec 6556	Extend class notation with the finite recursive definition generator, with characteristic function F and initial value I.
class frec ( F , I )
Definition	df-frec 6557*	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 6471 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 6563 and frecsuc 6573. 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 4702. 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 6574, this definition and df-irdg 6536 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 )
Theorem	freceq1 6558	Equality theorem for the finite recursive definition generator. (Contributed by Jim Kingdon, 30-May-2020.)
|- ( F = G -> frec ( F , A ) = frec ( G , A ) )
Theorem	freceq2 6559	Equality theorem for the finite recursive definition generator. (Contributed by Jim Kingdon, 30-May-2020.)
|- ( A = B -> frec ( F , A ) = frec ( F , B ) )
Theorem	frecex 6560	Finite recursion produces a set. (Contributed by Jim Kingdon, 20-Aug-2021.)
|- frec ( F , A ) e. _V
Theorem	frecfun 6561	Finite recursion produces a function. See also frecfnom 6567 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 )
Theorem	nffrec 6562	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 )
Theorem	frec0g 6563	The initial value resulting from finite recursive definition generation. (Contributed by Jim Kingdon, 7-May-2020.)
|- ( A e. V -> (frec ( F , A ) ` (/) ) = A )
Theorem	frecabex 6564*	The class abstraction from df-frec 6557 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 )
Theorem	frecabcl 6565*	The class abstraction from df-frec 6557 exists. Unlike frecabex 6564 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 )
Theorem	frectfr 6566*	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 6501 or tfri2d 6502, 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 ) )
Theorem	frecfnom 6567*	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 )
Theorem	freccllem 6568*	Lemma for freccl 6569. 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 )
Theorem	freccl 6569*	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 )
Theorem	frecfcllem 6570*	Lemma for frecfcl 6571. 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 )
Theorem	frecfcl 6571*	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 )
Theorem	frecsuclem 6572*	Lemma for frecsuc 6573. 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 ) ) )
Theorem	frecsuc 6573*	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 ) ) )
Theorem	frecrdg 6574*	Transfinite recursion restricted to omega. Given a suitable characteristic function, df-frec 6557 produces the same results as df-irdg 6536 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
Syntax	c1o 6575	Extend the definition of a class to include the ordinal number 1.
class 1o
Syntax	c2o 6576	Extend the definition of a class to include the ordinal number 2.
class 2o
Syntax	c3o 6577	Extend the definition of a class to include the ordinal number 3.
class 3o
Syntax	c4o 6578	Extend the definition of a class to include the ordinal number 4.
class 4o
Syntax	coa 6579	Extend the definition of a class to include the ordinal addition operation.
class +o
Syntax	comu 6580	Extend the definition of a class to include the ordinal multiplication operation.
class .o
Syntax	coei 6581	Extend the definition of a class to include the ordinal exponentiation operation.
class ↑o
Definition	df-1o 6582	Define the ordinal number 1. (Contributed by NM, 29-Oct-1995.)
|- 1o = suc (/)
Definition	df-2o 6583	Define the ordinal number 2. (Contributed by NM, 18-Feb-2004.)
|- 2o = suc 1o
Definition	df-3o 6584	Define the ordinal number 3. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- 3o = suc 2o
Definition	df-4o 6585	Define the ordinal number 4. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- 4o = suc 3o
Definition	df-oadd 6586*	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 ) )
Definition	df-omul 6587*	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 ) )
Definition	df-oexpi 6588*	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. We do not yet have an extensive development of ordinal exponentiation. For background on ordinal exponentiation without excluded middle, see Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, and Chuangjie Xu (2025), "Ordinal Exponentiation in Homotopy Type Theory", arXiv:2501.14542 , https://arxiv.org/abs/2501.14542 which is formalized in the TypeTopology proof library at https://ordinal-exponentiation-hott.github.io/. (Contributed by Mario Carneiro, 4-Jul-2019.)
|- ↑o = ( x e. On , y e. On |-> ( rec ( ( z e. _V |-> ( z .o x ) ) , 1o ) ` y ) )
Theorem	1on 6589	Ordinal 1 is an ordinal number. (Contributed by NM, 29-Oct-1995.)
|- 1o e. On
Theorem	1oex 6590	Ordinal 1 is a set. (Contributed by BJ, 4-Jul-2022.)
|- 1o e. _V
Theorem	2on 6591	Ordinal 2 is an ordinal number. (Contributed by NM, 18-Feb-2004.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)
|- 2o e. On
Theorem	2on0 6592	Ordinal two is not zero. (Contributed by Scott Fenton, 17-Jun-2011.)
|- 2o =/= (/)
Theorem	3on 6593	Ordinal 3 is an ordinal number. (Contributed by Mario Carneiro, 5-Jan-2016.)
|- 3o e. On
Theorem	ord3 6594	Ordinal 3 is an ordinal class. (Contributed by BTernaryTau, 6-Jan-2025.)
|- Ord 3o
Theorem	4on 6595	Ordinal 4 is an ordinal number. (Contributed by Mario Carneiro, 5-Jan-2016.)
|- 4o e. On
Theorem	df1o2 6596	Expanded value of the ordinal number 1. (Contributed by NM, 4-Nov-2002.)
|- 1o = { (/) }
Theorem	df2o3 6597	Expanded value of the ordinal number 2. (Contributed by Mario Carneiro, 14-Aug-2015.)
|- 2o = { (/) , 1o }
Theorem	df2o2 6598	Expanded value of the ordinal number 2. (Contributed by NM, 29-Jan-2004.)
|- 2o = { (/) , { (/) } }
Theorem	2oex 6599	2o is a set. (Contributed by BJ, 6-Apr-2019.) (Proof shortened by Zhi Wang, 19-Sep-2024.)
|- 2o e. _V
Theorem	1n0 6600	Ordinal one is not equal to ordinal zero. (Contributed by NM, 26-Dec-2004.)
|- 1o =/= (/)