| 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 8380 | . . 3 ⊢ rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) = rec((𝑐 ∈ ω, 𝑑 ∈ V ↦ 〈suc 𝑐, (𝑐𝐹𝑑)〉), 〈∅, ( I ‘𝐼)〉) | |
| 2 | 1 | seqomlem2 8382 | . 2 ⊢ (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) Fn ω |
| 3 | seqom.a | . . . 4 ⊢ 𝐺 = seqω(𝐹, 𝐼) | |
| 4 | df-seqom 8379 | . . . 4 ⊢ seqω(𝐹, 𝐼) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) | |
| 5 | 3, 4 | eqtri 2759 | . . 3 ⊢ 𝐺 = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) |
| 6 | 5 | fneq1i 6589 | . 2 ⊢ (𝐺 Fn ω ↔ (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) Fn ω) |
| 7 | 2, 6 | mpbir 231 | 1 ⊢ 𝐺 Fn ω |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 Vcvv 3440 ∅c0 4285 〈cop 4586 I cid 5518 “ cima 5627 suc csuc 6319 Fn wfn 6487 ‘cfv 6492 (class class class)co 7358 ∈ cmpo 7360 ωcom 7808 reccrdg 8340 seqωcseqom 8378 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-seqom 8379 |
| This theorem is referenced by: cantnfvalf 9574 fin23lem16 10245 fin23lem20 10247 fin23lem17 10248 fin23lem21 10249 fin23lem31 10253 |
| Copyright terms: Public domain | W3C validator |