| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > seqsfn | Structured version Visualization version GIF version | ||
| Description: The surreal sequence builder is a function. (Contributed by Scott Fenton, 19-Apr-2025.) |
| Ref | Expression |
|---|---|
| seqsfn.1 | ⊢ (𝜑 → 𝑀 ∈ No ) |
| seqsfn.2 | ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω)) |
| Ref | Expression |
|---|---|
| seqsfn | ⊢ (𝜑 → seqs𝑀( + , 𝐹) Fn 𝑍) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | seqsfn.1 | . 2 ⊢ (𝜑 → 𝑀 ∈ No ) | |
| 2 | eqidd 2738 | . 2 ⊢ (𝜑 → (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) ↾ ω) = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) ↾ ω)) | |
| 3 | seqsfn.2 | . . 3 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω)) | |
| 4 | oveq1 7368 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 +s 1s ) = (𝑦 +s 1s )) | |
| 5 | 4 | cbvmptv 5190 | . . . . 5 ⊢ (𝑥 ∈ V ↦ (𝑥 +s 1s )) = (𝑦 ∈ V ↦ (𝑦 +s 1s )) |
| 6 | rdgeq1 8344 | . . . . 5 ⊢ ((𝑥 ∈ V ↦ (𝑥 +s 1s )) = (𝑦 ∈ V ↦ (𝑦 +s 1s )) → rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) = rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀)) | |
| 7 | 5, 6 | ax-mp 5 | . . . 4 ⊢ rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) = rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) |
| 8 | 7 | imaeq1i 6017 | . . 3 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω) = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) “ ω) |
| 9 | 3, 8 | eqtrdi 2788 | . 2 ⊢ (𝜑 → 𝑍 = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) “ ω)) |
| 10 | fvexd 6850 | . 2 ⊢ (𝜑 → (𝐹‘𝑀) ∈ V) | |
| 11 | eqidd 2738 | . 2 ⊢ (𝜑 → (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ 〈(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)〉), 〈𝑀, (𝐹‘𝑀)〉) ↾ ω) = (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ 〈(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)〉), 〈𝑀, (𝐹‘𝑀)〉) ↾ ω)) | |
| 12 | 11 | seqsval 28297 | . 2 ⊢ (𝜑 → seqs𝑀( + , 𝐹) = ran (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ 〈(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)〉), 〈𝑀, (𝐹‘𝑀)〉) ↾ ω)) |
| 13 | 1, 2, 9, 10, 11, 12 | noseqrdgfn 28315 | 1 ⊢ (𝜑 → seqs𝑀( + , 𝐹) Fn 𝑍) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3430 〈cop 4574 ↦ cmpt 5167 ↾ cres 5627 “ cima 5628 Fn wfn 6488 ‘cfv 6493 (class class class)co 7361 ∈ cmpo 7363 ωcom 7811 reccrdg 8342 No csur 27620 1s c1s 27815 +s cadds 27968 seqscseqs 28292 |
| 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 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-ot 4577 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-nadd 8596 df-no 27623 df-lts 27624 df-bday 27625 df-les 27726 df-slts 27767 df-cuts 27769 df-0s 27816 df-1s 27817 df-made 27836 df-old 27837 df-left 27839 df-right 27840 df-norec2 27958 df-adds 27969 df-seqs 28293 |
| This theorem is referenced by: seqn0sfn 28369 |
| Copyright terms: Public domain | W3C validator |