| 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 8424 | . . 3 ⊢ rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) = rec((𝑐 ∈ ω, 𝑑 ∈ V ↦ 〈suc 𝑐, (𝑐𝐹𝑑)〉), 〈∅, ( I ‘𝐼)〉) | |
| 2 | 1 | seqomlem2 8426 | . 2 ⊢ (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) Fn ω |
| 3 | seqom.a | . . . 4 ⊢ 𝐺 = seqω(𝐹, 𝐼) | |
| 4 | df-seqom 8423 | . . . 4 ⊢ seqω(𝐹, 𝐼) = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) | |
| 5 | 3, 4 | eqtri 2788 | . . 3 ⊢ 𝐺 = (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) |
| 6 | 5 | fneq1i 6622 | . 2 ⊢ (𝐺 Fn ω ↔ (rec((𝑎 ∈ ω, 𝑏 ∈ V ↦ 〈suc 𝑎, (𝑎𝐹𝑏)〉), 〈∅, ( I ‘𝐼)〉) “ ω) Fn ω) |
| 7 | 2, 6 | mpbir 234 | 1 ⊢ 𝐺 Fn ω |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1563 Vcvv 3457 ∅c0 4288 〈cop 4591 I cid 5545 “ cima 5654 suc csuc 6351 Fn wfn 6520 ‘cfv 6525 (class class class)co 7400 ∈ cmpo 7402 ωcom 7850 reccrdg 8384 seqωcseqom 8422 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pr 5394 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-seqom 8423 |
| This theorem is referenced by: cantnfvalf 9622 fin23lem16 10307 fin23lem20 10309 fin23lem17 10310 fin23lem21 10311 fin23lem31 10315 |
| Copyright terms: Public domain | W3C validator |