Theorem tfr1on 6247

Description: Recursion is defined on an ordinal if the characteristic function is defined up to a suitable point. (Contributed by Jim Kingdon, 12-Mar-2022.)

Hypotheses

Ref	Expression
tfr1on.f	|- F = recs ( G )
tfr1on.g	|- ( ph -> Fun G )
tfr1on.x	|- ( ph -> Ord X )
tfr1on.ex	|- ( ( ph /\ x e. X /\ f Fn x ) -> ( G ` f ) e. _V )
tfr1on.u	|- ( ( ph /\ x e. U. X ) -> suc x e. X )
tfr1on.yx	|- ( ph -> Y e. X )

Assertion

Ref	Expression
tfr1on	|- ( ph -> Y C_ dom F )

Distinct variable groups:   f, G, x   f, X, x   f, Y, x   ph, f, x

Allowed substitution hints:   F( x, f)

Proof of Theorem tfr1on

Dummy variables a b c y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tfr1on.f	. 2 |- F = recs ( G )
2		tfr1on.g	. 2 |- ( ph -> Fun G )
3		tfr1on.x	. 2 |- ( ph -> Ord X )
4		tfr1on.ex	. 2 |- ( ( ph /\ x e. X /\ f Fn x ) -> ( G ` f ) e. _V )
5		eqid 2139	. . 3 |- { a | E. b e. X ( a Fn b /\ A. c e. b ( a ` c ) = ( G ` ( a |` c ) ) ) } = { a | E. b e. X ( a Fn b /\ A. c e. b ( a ` c ) = ( G ` ( a |` c ) ) ) }
6	5	tfr1onlem3 6235	. 2 |- { a | E. b e. X ( a Fn b /\ A. c e. b ( a ` c ) = ( G ` ( a |` c ) ) ) } = { f | E. x e. X ( f Fn x /\ A. y e. x ( f ` y ) = ( G ` ( f |` y ) ) ) }
7		tfr1on.u	. 2 |- ( ( ph /\ x e. U. X ) -> suc x e. X )
8		tfr1on.yx	. 2 |- ( ph -> Y e. X )
9	1, 2, 3, 4, 6, 7, 8	tfr1onlemres 6246	1 |- ( ph -> Y C_ dom F )

Syntax hints:   -> wi 4   /\ wa 103   /\ w3a 962   = wceq 1331   e. wcel 1480   {cab 2125   A.wral 2416   E.wrex 2417   _Vcvv 2686   C_ wss 3071   U.cuni 3736   Ord word 4284   suc csuc 4287   dom cdm 4539   |` cres 4541   Fun wfun 5117   Fn wfn 5118   ` cfv 5123  recscrecs 6201

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-recs 6202

This theorem is referenced by:  tfri1dALT  6248