Metamath Proof Explorer


Theorem abssnid

Description: For a negative surreal, its absolute value is its negation. (Contributed by Scott Fenton, 16-Apr-2025)

Ref Expression
Assertion abssnid ( ( 𝐴 No 𝐴 ≤s 0s ) → ( abss𝐴 ) = ( -us𝐴 ) )

Proof

Step Hyp Ref Expression
1 0sno 0s No
2 sleloe ( ( 𝐴 No ∧ 0s No ) → ( 𝐴 ≤s 0s ↔ ( 𝐴 <s 0s𝐴 = 0s ) ) )
3 1 2 mpan2 ( 𝐴 No → ( 𝐴 ≤s 0s ↔ ( 𝐴 <s 0s𝐴 = 0s ) ) )
4 sltnle ( ( 𝐴 No ∧ 0s No ) → ( 𝐴 <s 0s ↔ ¬ 0s ≤s 𝐴 ) )
5 1 4 mpan2 ( 𝐴 No → ( 𝐴 <s 0s ↔ ¬ 0s ≤s 𝐴 ) )
6 abssval ( 𝐴 No → ( abss𝐴 ) = if ( 0s ≤s 𝐴 , 𝐴 , ( -us𝐴 ) ) )
7 iffalse ( ¬ 0s ≤s 𝐴 → if ( 0s ≤s 𝐴 , 𝐴 , ( -us𝐴 ) ) = ( -us𝐴 ) )
8 6 7 sylan9eq ( ( 𝐴 No ∧ ¬ 0s ≤s 𝐴 ) → ( abss𝐴 ) = ( -us𝐴 ) )
9 8 ex ( 𝐴 No → ( ¬ 0s ≤s 𝐴 → ( abss𝐴 ) = ( -us𝐴 ) ) )
10 5 9 sylbid ( 𝐴 No → ( 𝐴 <s 0s → ( abss𝐴 ) = ( -us𝐴 ) ) )
11 abs0s ( abss ‘ 0s ) = 0s
12 negs0s ( -us ‘ 0s ) = 0s
13 11 12 eqtr4i ( abss ‘ 0s ) = ( -us ‘ 0s )
14 fveq2 ( 𝐴 = 0s → ( abss𝐴 ) = ( abss ‘ 0s ) )
15 fveq2 ( 𝐴 = 0s → ( -us𝐴 ) = ( -us ‘ 0s ) )
16 13 14 15 3eqtr4a ( 𝐴 = 0s → ( abss𝐴 ) = ( -us𝐴 ) )
17 16 a1i ( 𝐴 No → ( 𝐴 = 0s → ( abss𝐴 ) = ( -us𝐴 ) ) )
18 10 17 jaod ( 𝐴 No → ( ( 𝐴 <s 0s𝐴 = 0s ) → ( abss𝐴 ) = ( -us𝐴 ) ) )
19 3 18 sylbid ( 𝐴 No → ( 𝐴 ≤s 0s → ( abss𝐴 ) = ( -us𝐴 ) ) )
20 19 imp ( ( 𝐴 No 𝐴 ≤s 0s ) → ( abss𝐴 ) = ( -us𝐴 ) )