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

Theorem absnegs 28394
Description: Surreal absolute value of the negative. (Contributed by Scott Fenton, 16-Apr-2025.)
Assertion
Ref Expression
absnegs (𝐴 No → (abss‘( -us𝐴)) = (abss𝐴))

Proof of Theorem absnegs
StepHypRef Expression
1 negnegs 28191 . . . 4 (𝐴 No → ( -us ‘( -us𝐴)) = 𝐴)
21adantr 485 . . 3 ((𝐴 No ∧ 0s ≤s 𝐴) → ( -us ‘( -us𝐴)) = 𝐴)
3 negscl 28183 . . . 4 (𝐴 No → ( -us𝐴) ∈ No )
4 0no 27956 . . . . . . . 8 0s No
54a1i 11 . . . . . . 7 (𝐴 No → 0s No )
6 id 23 . . . . . . 7 (𝐴 No 𝐴 No )
75, 6lenegsd 28195 . . . . . 6 (𝐴 No → ( 0s ≤s 𝐴 ↔ ( -us𝐴) ≤s ( -us ‘ 0s )))
8 neg0s 28173 . . . . . . 7 ( -us ‘ 0s ) = 0s
98breq2i 5112 . . . . . 6 (( -us𝐴) ≤s ( -us ‘ 0s ) ↔ ( -us𝐴) ≤s 0s )
107, 9bitrdi 290 . . . . 5 (𝐴 No → ( 0s ≤s 𝐴 ↔ ( -us𝐴) ≤s 0s ))
1110biimpa 481 . . . 4 ((𝐴 No ∧ 0s ≤s 𝐴) → ( -us𝐴) ≤s 0s )
12 abssnid 28390 . . . 4 ((( -us𝐴) ∈ No ∧ ( -us𝐴) ≤s 0s ) → (abss‘( -us𝐴)) = ( -us ‘( -us𝐴)))
133, 11, 12syl2an2r 697 . . 3 ((𝐴 No ∧ 0s ≤s 𝐴) → (abss‘( -us𝐴)) = ( -us ‘( -us𝐴)))
14 abssid 28388 . . 3 ((𝐴 No ∧ 0s ≤s 𝐴) → (abss𝐴) = 𝐴)
152, 13, 143eqtr4d 2810 . 2 ((𝐴 No ∧ 0s ≤s 𝐴) → (abss‘( -us𝐴)) = (abss𝐴))
166, 5lenegsd 28195 . . . . . 6 (𝐴 No → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us𝐴)))
178breq1i 5111 . . . . . 6 (( -us ‘ 0s ) ≤s ( -us𝐴) ↔ 0s ≤s ( -us𝐴))
1816, 17bitrdi 290 . . . . 5 (𝐴 No → (𝐴 ≤s 0s ↔ 0s ≤s ( -us𝐴)))
1918biimpa 481 . . . 4 ((𝐴 No 𝐴 ≤s 0s ) → 0s ≤s ( -us𝐴))
20 abssid 28388 . . . 4 ((( -us𝐴) ∈ No ∧ 0s ≤s ( -us𝐴)) → (abss‘( -us𝐴)) = ( -us𝐴))
213, 19, 20syl2an2r 697 . . 3 ((𝐴 No 𝐴 ≤s 0s ) → (abss‘( -us𝐴)) = ( -us𝐴))
22 abssnid 28390 . . 3 ((𝐴 No 𝐴 ≤s 0s ) → (abss𝐴) = ( -us𝐴))
2321, 22eqtr4d 2803 . 2 ((𝐴 No 𝐴 ≤s 0s ) → (abss‘( -us𝐴)) = (abss𝐴))
24 lestric 27886 . . 3 (( 0s No 𝐴 No ) → ( 0s ≤s 𝐴𝐴 ≤s 0s ))
254, 24mpan 702 . 2 (𝐴 No → ( 0s ≤s 𝐴𝐴 ≤s 0s ))
2615, 23, 25mpjaodan 973 1 (𝐴 No → (abss‘( -us𝐴)) = (abss𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wo 860   = wceq 1563  wcel 2145   class class class wbr 5104  cfv 6525   No csur 27758   ≤s cles 27862   0s c0s 27952   -us cnegs 28166  absscabss 28384
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-tp 4590  df-op 4592  df-ot 4594  df-uni 4868  df-int 4908  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-tr 5212  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 6291  df-ord 6352  df-on 6353  df-suc 6355  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-1o 8441  df-2o 8442  df-nadd 8640  df-no 27761  df-lts 27762  df-bday 27763  df-les 27863  df-slts 27905  df-cuts 27907  df-0s 27954  df-made 27974  df-old 27975  df-left 27977  df-right 27978  df-norec 28085  df-norec2 28096  df-adds 28107  df-negs 28168  df-abss 28385
This theorem is referenced by:  abslts  28396  abssubs  28397
  Copyright terms: Public domain W3C validator