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

Theorem tfri1 6451
Description: 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.)

Hypotheses
Ref Expression
tfri1.1  |-  F  = recs ( G )
tfri1.2  |-  ( Fun 
G  /\  ( G `  x )  e.  _V )
Assertion
Ref Expression
tfri1  |-  F  Fn  On
Distinct variable group:    x, G
Allowed substitution hint:    F( x)

Proof of Theorem tfri1
StepHypRef Expression
1 tfri1.1 . . 3  |-  F  = recs ( G )
2 tfri1.2 . . . . 5  |-  ( Fun 
G  /\  ( G `  x )  e.  _V )
32ax-gen 1472 . . . 4  |-  A. x
( Fun  G  /\  ( G `  x )  e.  _V )
43a1i 9 . . 3  |-  ( T. 
->  A. x ( Fun 
G  /\  ( G `  x )  e.  _V ) )
51, 4tfri1d 6421 . 2  |-  ( T. 
->  F  Fn  On )
65mptru 1382 1  |-  F  Fn  On
Colors of variables: wff set class
Syntax hints:    /\ wa 104   A.wal 1371    = wceq 1373   T. wtru 1374    e. wcel 2176   _Vcvv 2772   Oncon0 4410   Fun wfun 5265    Fn wfn 5266   ` cfv 5271  recscrecs 6390
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-id 4340  df-iord 4413  df-on 4415  df-suc 4418  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-recs 6391
This theorem is referenced by:  tfri2  6452  tfri3  6453
  Copyright terms: Public domain W3C validator