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

Theorem negsex 28316
Description: Every surreal has a negative. Note that this theorem, addscl 28254, addscom 28239, addsass 28278, addsrid 28237, and ltadds1im 28258 are the ordered Abelian group axioms. However, the surreals cannot be said to be an ordered Abelian group because No is a proper class. (Contributed by Scott Fenton, 3-Feb-2025.)
Assertion
Ref Expression
negsex (𝐴 No → ∃𝑥 No (𝐴 +s 𝑥) = 0s )
Distinct variable group:   𝑥,𝐴

Proof of Theorem negsex
StepHypRef Expression
1 negscl 28309 . 2 (𝐴 No → ( -us𝐴) ∈ No )
2 negsid 28314 . 2 (𝐴 No → (𝐴 +s ( -us𝐴)) = 0s )
3 oveq2 7425 . . . 4 (𝑥 = ( -us𝐴) → (𝐴 +s 𝑥) = (𝐴 +s ( -us𝐴)))
43eqeq1d 2764 . . 3 (𝑥 = ( -us𝐴) → ((𝐴 +s 𝑥) = 0s ↔ (𝐴 +s ( -us𝐴)) = 0s ))
54rspcev 3579 . 2 ((( -us𝐴) ∈ No ∧ (𝐴 +s ( -us𝐴)) = 0s ) → ∃𝑥 No (𝐴 +s 𝑥) = 0s )
61, 2, 5syl2anc 596 1 (𝐴 No → ∃𝑥 No (𝐴 +s 𝑥) = 0s )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  wrex 3088  cfv 6537  (class class class)co 7417   No csur 27884   0s c0s 28078   +s cadds 28232   -us cnegs 28292
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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-ot 4596  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-1o 8459  df-2o 8460  df-nadd 8658  df-no 27887  df-lts 27888  df-bday 27889  df-les 27989  df-slts 28031  df-cuts 28033  df-0s 28080  df-made 28100  df-old 28101  df-left 28103  df-right 28104  df-norec 28211  df-norec2 28222  df-adds 28233  df-negs 28294
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator