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

Theorem tfri1 6596
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 1498 . . . 4  |-  A. x
( Fun  G  /\  ( G `  x )  e.  _V )
43a1i 9 . . 3  |-  ( T. 
->  A. x ( Fun 
G  /\  ( G `  x )  e.  _V ) )
51, 4tfri1d 6566 . 2  |-  ( T. 
->  F  Fn  On )
65mptru 1407 1  |-  F  Fn  On
Colors of variables: wff set class
Syntax hints:    /\ wa 104   A.wal 1396    = wceq 1398   T. wtru 1399    e. wcel 2203   _Vcvv 2813   Oncon0 4484   Fun wfun 5346    Fn wfn 5347   ` cfv 5352  recscrecs 6535
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659
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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-recs 6536
This theorem is referenced by:  tfri2  6597  tfri3  6598
  Copyright terms: Public domain W3C validator