Theorem frecfnom 6510

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 2207	. . . 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 2207	. . . . 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 6509	. . . 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 6444	. . 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 5410	. . 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 4679	. . . . . 6 |- om C_ On
8		sseqin2 3400	. . . . . 6 |- ( om C_ On <-> ( On i^i om ) = om )
9	7, 8	mpbi 145	. . . . 5 |- ( On i^i om ) = om
10	9	reseq2i 4975	. . . 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 6500	. . . 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 2231	. . 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 5386	. . 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 426	. 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 )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 710   A.wal 1371   = wceq 1373   e. wcel 2178   {cab 2193   E.wrex 2487   _Vcvv 2776   i^i cin 3173   C_ wss 3174   (/)c0 3468   |-> cmpt 4121   Oncon0 4428   suc csuc 4430   omcom 4656   dom cdm 4693   |` cres 4695   Fn wfn 5285   ` cfv 5290  recscrecs 6413  freccfrec 6499

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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-iord 4431  df-on 4433  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-recs 6414  df-frec 6500

This theorem is referenced by:  frecrdg  6517  frec2uzrand  10587  frec2uzf1od  10588  frecfzennn  10608  hashinfom  10960