Theorem frecfnom 6298

Description: The function generated by finite recursive definition generation is a function on omega. (Contributed by Jim Kingdon, 13-May-2020.)

Assertion

Ref	Expression
frecfnom	|- ( ( A. z ( F ` z ) e. _V /\ A e. V ) -> frec ( F , A ) Fn om )

Distinct variable groups:   z, A   z, F

Allowed substitution hint:   V( z)

Proof of Theorem frecfnom

Dummy variables g m x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2139	. . . 4 |- recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) = recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) )
2		eqid 2139	. . . . 5 |- ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) = ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } )
3	2	frectfr 6297	. . . 4 |- ( ( A. z ( F ` z ) e. _V /\ A e. V ) -> A. y ( Fun ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) /\ ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ` y ) e. _V ) )
4	1, 3	tfri1d 6232	. . 3 |- ( ( A. z ( F ` z ) e. _V /\ A e. V ) -> recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) Fn On )
5		fnresin1 5237	. . 3 |- (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) Fn On -> (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` ( On i^i om ) ) Fn ( On i^i om ) )
6	4, 5	syl 14	. 2 |- ( ( A. z ( F ` z ) e. _V /\ A e. V ) -> (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` ( On i^i om ) ) Fn ( On i^i om ) )
7		omsson 4526	. . . . . 6 |- om C_ On
8		sseqin2 3295	. . . . . 6 |- ( om C_ On <-> ( On i^i om ) = om )
9	7, 8	mpbi 144	. . . . 5 |- ( On i^i om ) = om
10	9	reseq2i 4816	. . . 4 |- (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` ( On i^i om ) ) = (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` om )
11		df-frec 6288	. . . 4 |- frec ( F , A ) = (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` om )
12	10, 11	eqtr4i 2163	. . 3 |- (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` ( On i^i om ) ) = frec ( F , A )
13		fneq12 5216	. . 3 |- ( ( (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` ( On i^i om ) ) = frec ( F , A ) /\ ( On i^i om ) = om ) -> ( (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` ( On i^i om ) ) Fn ( On i^i om ) <-> frec ( F , A ) Fn om ) )
14	12, 9, 13	mp2an 422	. 2 |- ( (recs ( ( g e. _V |-> { x | ( E. m e. om ( dom g = suc m /\ x e. ( F ` ( g ` m ) ) ) \/ ( dom g = (/) /\ x e. A ) ) } ) ) |` ( On i^i om ) ) Fn ( On i^i om ) <-> frec ( F , A ) Fn om )
15	6, 14	sylib 121	1 |- ( ( A. z ( F ` z ) e. _V /\ A e. V ) -> frec ( F , A ) Fn om )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 697   A.wal 1329   = wceq 1331   e. wcel 1480   {cab 2125   E.wrex 2417   _Vcvv 2686   i^i cin 3070   C_ wss 3071   (/)c0 3363   |-> cmpt 3989   Oncon0 4285   suc csuc 4287   omcom 4504   dom cdm 4539   |` cres 4541   Fn wfn 5118   ` cfv 5123  recscrecs 6201  freccfrec 6287

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-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502

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-int 3772  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-iom 4505  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  df-frec 6288

This theorem is referenced by:  frecrdg  6305  frec2uzrand  10178  frec2uzf1od  10179  frecfzennn  10199  hashinfom  10524