| 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 27806 | . . 3 ⊢ 1s ∈ No | |
| 2 | negsval 28021 | . . 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 27892 | . . . . 5 ⊢ ( R ‘ 1s ) = ∅ | |
| 5 | 4 | imaeq2i 6017 | . . . 4 ⊢ ( -us “ ( R ‘ 1s )) = ( -us “ ∅) |
| 6 | ima0 6036 | . . . 4 ⊢ ( -us “ ∅) = ∅ | |
| 7 | 5, 6 | eqtri 2759 | . . 3 ⊢ ( -us “ ( R ‘ 1s )) = ∅ |
| 8 | left1s 27891 | . . . . 5 ⊢ ( L ‘ 1s ) = { 0s } | |
| 9 | 8 | imaeq2i 6017 | . . . 4 ⊢ ( -us “ ( L ‘ 1s )) = ( -us “ { 0s }) |
| 10 | negsfn 28019 | . . . . . . 7 ⊢ -us Fn No | |
| 11 | 0no 27805 | . . . . . . 7 ⊢ 0s ∈ No | |
| 12 | fnimapr 6917 | . . . . . . 7 ⊢ (( -us Fn No ∧ 0s ∈ No ∧ 0s ∈ No ) → ( -us “ { 0s , 0s }) = {( -us ‘ 0s ), ( -us ‘ 0s )}) | |
| 13 | 10, 11, 11, 12 | mp3an 1463 | . . . . . 6 ⊢ ( -us “ { 0s , 0s }) = {( -us ‘ 0s ), ( -us ‘ 0s )} |
| 14 | neg0s 28022 | . . . . . . 7 ⊢ ( -us ‘ 0s ) = 0s | |
| 15 | 14, 14 | preq12i 4695 | . . . . . 6 ⊢ {( -us ‘ 0s ), ( -us ‘ 0s )} = { 0s , 0s } |
| 16 | 13, 15 | eqtri 2759 | . . . . 5 ⊢ ( -us “ { 0s , 0s }) = { 0s , 0s } |
| 17 | dfsn2 4593 | . . . . . 6 ⊢ { 0s } = { 0s , 0s } | |
| 18 | 17 | imaeq2i 6017 | . . . . 5 ⊢ ( -us “ { 0s }) = ( -us “ { 0s , 0s }) |
| 19 | 16, 18, 17 | 3eqtr4i 2769 | . . . 4 ⊢ ( -us “ { 0s }) = { 0s } |
| 20 | 9, 19 | eqtri 2759 | . . 3 ⊢ ( -us “ ( L ‘ 1s )) = { 0s } |
| 21 | 7, 20 | oveq12i 7370 | . 2 ⊢ (( -us “ ( R ‘ 1s )) |s ( -us “ ( L ‘ 1s ))) = (∅ |s { 0s }) |
| 22 | 3, 21 | eqtri 2759 | 1 ⊢ ( -us ‘ 1s ) = (∅ |s { 0s }) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∈ wcel 2113 ∅c0 4285 {csn 4580 {cpr 4582 “ cima 5627 Fn wfn 6487 ‘cfv 6492 (class class class)co 7358 No csur 27607 |s ccuts 27755 0s c0s 27801 1s c1s 27802 L cleft 27821 R cright 27822 -us cnegs 28015 |
| 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-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 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-rmo 3350 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-tp 4585 df-op 4587 df-uni 4864 df-int 4903 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-se 5578 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-1o 8397 df-2o 8398 df-no 27610 df-lts 27611 df-bday 27612 df-les 27713 df-slts 27754 df-cuts 27756 df-0s 27803 df-1s 27804 df-made 27823 df-old 27824 df-left 27826 df-right 27827 df-norec 27934 df-negs 28017 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |