![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > frfnom | Structured version Visualization version GIF version |
Description: The function generated by finite recursive definition generation is a function on omega. (Contributed by NM, 15-Oct-1996.) (Revised by Mario Carneiro, 14-Nov-2014.) |
Ref | Expression |
---|---|
frfnom | ⊢ (rec(𝐹, 𝐴) ↾ ω) Fn ω |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rdgfun 8422 | . . 3 ⊢ Fun rec(𝐹, 𝐴) | |
2 | funres 6590 | . . 3 ⊢ (Fun rec(𝐹, 𝐴) → Fun (rec(𝐹, 𝐴) ↾ ω)) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ Fun (rec(𝐹, 𝐴) ↾ ω) |
4 | dmres 6003 | . . 3 ⊢ dom (rec(𝐹, 𝐴) ↾ ω) = (ω ∩ dom rec(𝐹, 𝐴)) | |
5 | rdgdmlim 8423 | . . . . 5 ⊢ Lim dom rec(𝐹, 𝐴) | |
6 | limomss 7864 | . . . . 5 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
7 | 5, 6 | ax-mp 5 | . . . 4 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
8 | df-ss 3965 | . . . 4 ⊢ (ω ⊆ dom rec(𝐹, 𝐴) ↔ (ω ∩ dom rec(𝐹, 𝐴)) = ω) | |
9 | 7, 8 | mpbi 229 | . . 3 ⊢ (ω ∩ dom rec(𝐹, 𝐴)) = ω |
10 | 4, 9 | eqtri 2759 | . 2 ⊢ dom (rec(𝐹, 𝐴) ↾ ω) = ω |
11 | df-fn 6546 | . 2 ⊢ ((rec(𝐹, 𝐴) ↾ ω) Fn ω ↔ (Fun (rec(𝐹, 𝐴) ↾ ω) ∧ dom (rec(𝐹, 𝐴) ↾ ω) = ω)) | |
12 | 3, 10, 11 | mpbir2an 708 | 1 ⊢ (rec(𝐹, 𝐴) ↾ ω) Fn ω |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1540 ∩ cin 3947 ⊆ wss 3948 dom cdm 5676 ↾ cres 5678 Lim wlim 6365 Fun wfun 6537 Fn wfn 6538 ωcom 7859 reccrdg 8415 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-sep 5299 ax-nul 5306 ax-pr 5427 ax-un 7729 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7415 df-om 7860 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 |
This theorem is referenced by: frsucmptn 8445 seqomlem2 8457 seqomlem3 8458 seqomlem4 8459 unblem4 9304 dffi3 9432 inf0 9622 inf3lem6 9634 alephfplem4 10108 alephfp 10109 infpssrlem3 10306 itunifn 10418 hsmexlem5 10431 axdclem2 10521 wunex2 10739 wuncval2 10748 peano5nni 12222 1nn 12230 peano2nn 12231 om2uzrani 13924 om2uzf1oi 13925 uzrdglem 13929 uzrdgfni 13930 uzrdg0i 13931 hashkf 14299 hashgval2 14345 peano5n0s 28075 0n0s 28083 peano2n0s 28084 neibastop2lem 35709 |
Copyright terms: Public domain | W3C validator |