Theorem frecfnom 6672

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 2238	. . . 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 2238	. . . . 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 6671	. . . 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 6606	. . 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 5498	. . 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 4760	. . . . . 6 |- om C_ On
8		sseqin2 3450	. . . . . 6 |- ( om C_ On <-> ( On i^i om ) = om )
9	7, 8	mpbi 145	. . . . 5 |- ( On i^i om ) = om
10	9	reseq2i 5060	. . . 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 6662	. . . 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 2262	. . 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 5474	. . 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 430	. 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 122	1 |- ( ( A. z ( F ` z ) e. _V /\ A e. V ) -> frec ( F , A ) Fn om )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   A.wal 1400   = wceq 1402   e. wcel 2209   {cab 2224   E.wrex 2529   _Vcvv 2821   i^i cin 3219   C_ wss 3220   (/)c0 3520   |-> cmpt 4192   Oncon0 4508   suc csuc 4510   omcom 4737   dom cdm 4774   |` cres 4776   Fn wfn 5372   ` cfv 5377  recscrecs 6575  freccfrec 6661

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-recs 6576  df-frec 6662

This theorem is used by:  frecrdg  6679  frec2uzrand  10842  frec2uzf1od  10843  frecfzennn  10863  hashinfom  11217