MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  neg1s Structured version   Visualization version   GIF version

Theorem neg1s 28470
Description: An expression for negative surreal one. (Contributed by Scott Fenton, 24-Jul-2025.)
Assertion
Ref Expression
neg1s ( -s‘ 1s ) = (∅ |s { 0s })

Proof of Theorem neg1s
StepHypRef Expression
1 1no 28253 . . 3 1s ∈ No
2 negsval 28468 . . 3 ( 1s ∈ No → ( -s‘ 1s ) = (( -s “ (R‘ 1s )) |s ( -s “ (L‘ 1s ))))
31, 2ax-mp 5 . 2 ( -s‘ 1s ) = (( -s “ (R‘ 1s )) |s ( -s “ (L‘ 1s )))
4 right1s 28339 . . . . 5 (R‘ 1s ) = ∅
54imaeq2i 6068 . . . 4 ( -s “ (R‘ 1s )) = ( -s “ ∅)
6 ima0 6093 . . . 4 ( -s “ ∅) = ∅
75, 6eqtri 2786 . . 3 ( -s “ (R‘ 1s )) = ∅
8 left1s 28338 . . . . 5 (L‘ 1s ) = { 0s }
98imaeq2i 6068 . . . 4 ( -s “ (L‘ 1s )) = ( -s “ { 0s })
10 negsfn 28466 . . . . . . 7 -s Fn No
11 0no 28252 . . . . . . 7 0s ∈ No
12 fnimapr 6999 . . . . . . 7 (( -s Fn No ∧ 0s ∈ No ∧ 0s ∈ No) → ( -s “ { 0s , 0s }) = {( -s‘ 0s ), ( -s‘ 0s )})
1310, 11, 11, 12mp3an 1491 . . . . . 6 ( -s “ { 0s , 0s }) = {( -s‘ 0s ), ( -s‘ 0s )}
14 neg0s 28469 . . . . . . 7 ( -s‘ 0s ) = 0s
1514, 14preq12i 4701 . . . . . 6 {( -s‘ 0s ), ( -s‘ 0s )} = { 0s , 0s }
1613, 15eqtri 2786 . . . . 5 ( -s “ { 0s , 0s }) = { 0s , 0s }
17 dfsn2 4597 . . . . . 6 { 0s } = { 0s , 0s }
1817imaeq2i 6068 . . . . 5 ( -s “ { 0s }) = ( -s “ { 0s , 0s })
1916, 18, 173eqtr4i 2796 . . . 4 ( -s “ { 0s }) = { 0s }
209, 19eqtri 2786 . . 3 ( -s “ (L‘ 1s )) = { 0s }
217, 20oveq12i 7463 . 2 (( -s “ (R‘ 1s )) |s ( -s “ (L‘ 1s ))) = (∅ |s { 0s })
223, 21eqtri 2786 1 ( -s‘ 1s ) = (∅ |s { 0s })
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  ∅c0 4281  {csn 4588  {cpr 4590   “ cima 5661   Fn wfn 6561  ‘cfv 6566  (class class class)co 7451  Nocsur 28054   |s ccuts 28202   0s c0s 28248   1s c1s 28249  Lcleft 28268  Rcright 28269   -scnegs 28462
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-1o 8514  df-2o 8515  df-no 28057  df-lts 28058  df-bday 28059  df-les 28159  df-slts 28201  df-cuts 28203  df-0s 28250  df-1s 28251  df-made 28270  df-old 28271  df-left 28273  df-right 28274  df-norec 28381  df-negs 28464
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator