| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > neg1s | Structured version Visualization version GIF version | ||
| Description: An expression for negative surreal one. (Contributed by Scott Fenton, 24-Jul-2025.) |
| Ref | Expression |
|---|---|
| neg1s | ⊢ ( -us ‘ 1s ) = (∅ |s { 0s }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1no 28178 | . . 3 ⊢ 1s ∈ No | |
| 2 | negsval 28393 | . . 3 ⊢ ( 1s ∈ No → ( -us ‘ 1s ) = (( -us “ ( R ‘ 1s )) |s ( -us “ ( L ‘ 1s )))) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ( -us ‘ 1s ) = (( -us “ ( R ‘ 1s )) |s ( -us “ ( L ‘ 1s ))) |
| 4 | right1s 28264 | . . . . 5 ⊢ ( R ‘ 1s ) = ∅ | |
| 5 | 4 | imaeq2i 6052 | . . . 4 ⊢ ( -us “ ( R ‘ 1s )) = ( -us “ ∅) |
| 6 | ima0 6071 | . . . 4 ⊢ ( -us “ ∅) = ∅ | |
| 7 | 5, 6 | eqtri 2784 | . . 3 ⊢ ( -us “ ( R ‘ 1s )) = ∅ |
| 8 | left1s 28263 | . . . . 5 ⊢ ( L ‘ 1s ) = { 0s } | |
| 9 | 8 | imaeq2i 6052 | . . . 4 ⊢ ( -us “ ( L ‘ 1s )) = ( -us “ { 0s }) |
| 10 | negsfn 28391 | . . . . . . 7 ⊢ -us Fn No | |
| 11 | 0no 28177 | . . . . . . 7 ⊢ 0s ∈ No | |
| 12 | fnimapr 6960 | . . . . . . 7 ⊢ (( -us Fn No ∧ 0s ∈ No ∧ 0s ∈ No ) → ( -us “ { 0s , 0s }) = {( -us ‘ 0s ), ( -us ‘ 0s )}) | |
| 13 | 10, 11, 11, 12 | mp3an 1490 | . . . . . 6 ⊢ ( -us “ { 0s , 0s }) = {( -us ‘ 0s ), ( -us ‘ 0s )} |
| 14 | neg0s 28394 | . . . . . . 7 ⊢ ( -us ‘ 0s ) = 0s | |
| 15 | 14, 14 | preq12i 4699 | . . . . . 6 ⊢ {( -us ‘ 0s ), ( -us ‘ 0s )} = { 0s , 0s } |
| 16 | 13, 15 | eqtri 2784 | . . . . 5 ⊢ ( -us “ { 0s , 0s }) = { 0s , 0s } |
| 17 | dfsn2 4597 | . . . . . 6 ⊢ { 0s } = { 0s , 0s } | |
| 18 | 17 | imaeq2i 6052 | . . . . 5 ⊢ ( -us “ { 0s }) = ( -us “ { 0s , 0s }) |
| 19 | 16, 18, 17 | 3eqtr4i 2794 | . . . 4 ⊢ ( -us “ { 0s }) = { 0s } |
| 20 | 9, 19 | eqtri 2784 | . . 3 ⊢ ( -us “ ( L ‘ 1s )) = { 0s } |
| 21 | 7, 20 | oveq12i 7424 | . 2 ⊢ (( -us “ ( R ‘ 1s )) |s ( -us “ ( L ‘ 1s ))) = (∅ |s { 0s }) |
| 22 | 3, 21 | eqtri 2784 | 1 ⊢ ( -us ‘ 1s ) = (∅ |s { 0s }) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 ∅c0 4279 {csn 4584 {cpr 4586 “ cima 5654 Fn wfn 6526 ‘cfv 6531 (class class class)co 7412 No csur 27979 |s ccuts 28127 0s c0s 28173 1s c1s 28174 L cleft 28193 R cright 28194 -us cnegs 28387 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 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 6297 df-ord 6358 df-on 6359 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-1o 8460 df-2o 8461 df-no 27982 df-lts 27983 df-bday 27984 df-les 28084 df-slts 28126 df-cuts 28128 df-0s 28175 df-1s 28176 df-made 28195 df-old 28196 df-left 28198 df-right 28199 df-norec 28306 df-negs 28389 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |