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 8218 | . . 3 ⊢ Fun rec(𝐹, 𝐴) | |
2 | funres 6460 | . . 3 ⊢ (Fun rec(𝐹, 𝐴) → Fun (rec(𝐹, 𝐴) ↾ ω)) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ Fun (rec(𝐹, 𝐴) ↾ ω) |
4 | dmres 5902 | . . 3 ⊢ dom (rec(𝐹, 𝐴) ↾ ω) = (ω ∩ dom rec(𝐹, 𝐴)) | |
5 | rdgdmlim 8219 | . . . . 5 ⊢ Lim dom rec(𝐹, 𝐴) | |
6 | limomss 7692 | . . . . 5 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
7 | 5, 6 | ax-mp 5 | . . . 4 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
8 | df-ss 3900 | . . . 4 ⊢ (ω ⊆ dom rec(𝐹, 𝐴) ↔ (ω ∩ dom rec(𝐹, 𝐴)) = ω) | |
9 | 7, 8 | mpbi 229 | . . 3 ⊢ (ω ∩ dom rec(𝐹, 𝐴)) = ω |
10 | 4, 9 | eqtri 2766 | . 2 ⊢ dom (rec(𝐹, 𝐴) ↾ ω) = ω |
11 | df-fn 6421 | . 2 ⊢ ((rec(𝐹, 𝐴) ↾ ω) Fn ω ↔ (Fun (rec(𝐹, 𝐴) ↾ ω) ∧ dom (rec(𝐹, 𝐴) ↾ ω) = ω)) | |
12 | 3, 10, 11 | mpbir2an 707 | 1 ⊢ (rec(𝐹, 𝐴) ↾ ω) Fn ω |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∩ cin 3882 ⊆ wss 3883 dom cdm 5580 ↾ cres 5582 Lim wlim 6252 Fun wfun 6412 Fn wfn 6413 ωcom 7687 reccrdg 8211 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 |
This theorem is referenced by: frsucmptn 8240 seqomlem2 8252 seqomlem3 8253 seqomlem4 8254 unblem4 8999 dffi3 9120 inf0 9309 inf3lem6 9321 dftrpred2 9397 trpredpred 9406 trpredex 9416 alephfplem4 9794 alephfp 9795 infpssrlem3 9992 itunifn 10104 hsmexlem5 10117 axdclem2 10207 wunex2 10425 wuncval2 10434 peano5nni 11906 1nn 11914 peano2nn 11915 om2uzrani 13600 om2uzf1oi 13601 uzrdglem 13605 uzrdgfni 13606 uzrdg0i 13607 hashkf 13974 hashgval2 14021 neibastop2lem 34476 |
Copyright terms: Public domain | W3C validator |