| 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 8388 | . . 3 ⊢ rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) = rec((𝑐 ∈ ω, 𝑑 ∈ V ↦ 〈suc 𝑐, (𝑐𝐹𝑑)〉), 〈∅, ( I ‘𝐼)〉) | |
| 2 | 1 | seqomlem2 8390 | . 2 ⊢ (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) Fn ω |
| 3 | seqom.a | . . . 4 ⊢ 𝐺 = seqω(𝐹, 𝐼) | |
| 4 | df-seqom 8387 | . . . 4 ⊢ seqω(𝐹, 𝐼) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) | |
| 5 | 3, 4 | eqtri 2759 | . . 3 ⊢ 𝐺 = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) |
| 6 | 5 | fneq1i 6595 | . 2 ⊢ (𝐺 Fn ω ↔ (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) Fn ω) |
| 7 | 2, 6 | mpbir 231 | 1 ⊢ 𝐺 Fn ω |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 Vcvv 3429 ∅c0 4273 〈cop 4573 I cid 5525 “ cima 5634 suc csuc 6325 Fn wfn 6493 ‘cfv 6498 (class class class)co 7367 ∈ cmpo 7369 ωcom 7817 reccrdg 8348 seqωcseqom 8386 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-seqom 8387 |
| This theorem is referenced by: cantnfvalf 9586 fin23lem16 10257 fin23lem20 10259 fin23lem17 10260 fin23lem21 10261 fin23lem31 10265 |
| Copyright terms: Public domain | W3C validator |