| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnseqom | Structured version Visualization version GIF version | ||
| Description: An index-aware recursive definition defines a function on the natural numbers. (Contributed by Stefan O'Rear, 1-Nov-2014.) |
| Ref | Expression |
|---|---|
| seqom.a | ⊢ 𝐺 = seqω(𝐹, 𝐼) |
| Ref | Expression |
|---|---|
| fnseqom | ⊢ 𝐺 Fn ω |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | seqomlem0 8413 | . . 3 ⊢ rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) = rec((𝑐 ∈ ω, 𝑑 ∈ V ↦ 〈suc 𝑐, (𝑐𝐹𝑑)〉), 〈∅, ( I ‘𝐼)〉) | |
| 2 | 1 | seqomlem2 8415 | . 2 ⊢ (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) Fn ω |
| 3 | seqom.a | . . . 4 ⊢ 𝐺 = seqω(𝐹, 𝐼) | |
| 4 | df-seqom 8412 | . . . 4 ⊢ seqω(𝐹, 𝐼) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) | |
| 5 | 3, 4 | eqtri 2784 | . . 3 ⊢ 𝐺 = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) |
| 6 | 5 | fneq1i 6612 | . 2 ⊢ (𝐺 Fn ω ↔ (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) Fn ω) |
| 7 | 2, 6 | mpbir 233 | 1 ⊢ 𝐺 Fn ω |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 Vcvv 3453 ∅c0 4283 〈cop 4585 I cid 5537 “ cima 5646 suc csuc 6342 Fn wfn 6510 ‘cfv 6515 (class class class)co 7390 ∈ cmpo 7392 ωcom 7840 reccrdg 8373 seqωcseqom 8411 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pr 5387 ax-un 7712 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-seqom 8412 |
| This theorem is referenced by: cantnfvalf 9613 fin23lem16 10285 fin23lem20 10287 fin23lem17 10288 fin23lem21 10289 fin23lem31 10293 |
| Copyright terms: Public domain | W3C validator |