| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > madef | Structured version Visualization version GIF version | ||
| Description: The made function is a function from ordinals to sets of surreals. (Contributed by Scott Fenton, 6-Aug-2024.) |
| Ref | Expression |
|---|---|
| madef | ⊢ M :On⟶𝒫 No |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-made 27833 | . . 3 ⊢ M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))) | |
| 2 | 1 | tfr1 8329 | . 2 ⊢ M Fn On |
| 3 | madeval2 27839 | . . . . . . 7 ⊢ (𝑥 ∈ On → ( M ‘𝑥) = {𝑦 ∈ No ∣ ∃𝑧 ∈ 𝒫 ∪ ( M “ 𝑥)∃𝑤 ∈ 𝒫 ∪ ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)}) | |
| 4 | ssrab2 4021 | . . . . . . 7 ⊢ {𝑦 ∈ No ∣ ∃𝑧 ∈ 𝒫 ∪ ( M “ 𝑥)∃𝑤 ∈ 𝒫 ∪ ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)} ⊆ No | |
| 5 | 3, 4 | eqsstrdi 3967 | . . . . . 6 ⊢ (𝑥 ∈ On → ( M ‘𝑥) ⊆ No ) |
| 6 | sseq1 3948 | . . . . . 6 ⊢ (𝑦 = ( M ‘𝑥) → (𝑦 ⊆ No ↔ ( M ‘𝑥) ⊆ No )) | |
| 7 | 5, 6 | syl5ibrcom 247 | . . . . 5 ⊢ (𝑥 ∈ On → (𝑦 = ( M ‘𝑥) → 𝑦 ⊆ No )) |
| 8 | 7 | rexlimiv 3132 | . . . 4 ⊢ (∃𝑥 ∈ On 𝑦 = ( M ‘𝑥) → 𝑦 ⊆ No ) |
| 9 | vex 3434 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 10 | eqeq1 2741 | . . . . . 6 ⊢ (𝑧 = 𝑦 → (𝑧 = ( M ‘𝑥) ↔ 𝑦 = ( M ‘𝑥))) | |
| 11 | 10 | rexbidv 3162 | . . . . 5 ⊢ (𝑧 = 𝑦 → (∃𝑥 ∈ On 𝑧 = ( M ‘𝑥) ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥))) |
| 12 | fnrnfv 6893 | . . . . . 6 ⊢ ( M Fn On → ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)}) | |
| 13 | 2, 12 | ax-mp 5 | . . . . 5 ⊢ ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)} |
| 14 | 9, 11, 13 | elab2 3626 | . . . 4 ⊢ (𝑦 ∈ ran M ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥)) |
| 15 | velpw 4547 | . . . 4 ⊢ (𝑦 ∈ 𝒫 No ↔ 𝑦 ⊆ No ) | |
| 16 | 8, 14, 15 | 3imtr4i 292 | . . 3 ⊢ (𝑦 ∈ ran M → 𝑦 ∈ 𝒫 No ) |
| 17 | 16 | ssriv 3926 | . 2 ⊢ ran M ⊆ 𝒫 No |
| 18 | df-f 6496 | . 2 ⊢ ( M :On⟶𝒫 No ↔ ( M Fn On ∧ ran M ⊆ 𝒫 No )) | |
| 19 | 2, 17, 18 | mpbir2an 712 | 1 ⊢ M :On⟶𝒫 No |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1542 ∈ wcel 2114 {cab 2715 ∃wrex 3062 {crab 3390 Vcvv 3430 ⊆ wss 3890 𝒫 cpw 4542 ∪ cuni 4851 class class class wbr 5086 ↦ cmpt 5167 × cxp 5622 ran crn 5625 “ cima 5627 Oncon0 6317 Fn wfn 6487 ⟶wf 6488 ‘cfv 6492 (class class class)co 7360 No csur 27617 <<s cslts 27763 |s ccuts 27765 M cmade 27828 |
| 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 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| 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-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 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-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-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-1o 8398 df-2o 8399 df-no 27620 df-lts 27621 df-bday 27622 df-slts 27764 df-cuts 27766 df-made 27833 |
| This theorem is referenced by: oldf 27843 newf 27844 madessno 27846 elmade 27863 elold 27865 old1 27871 madess 27872 madeoldsuc 27891 madebdayim 27894 madefi 27919 oldfi 27920 oldfib 28383 |
| Copyright terms: Public domain | W3C validator |