| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abssnid | Structured version Visualization version GIF version | ||
| Description: For a negative surreal, its absolute value is its negation. (Contributed by Scott Fenton, 16-Apr-2025.) |
| Ref | Expression |
|---|---|
| abssnid | ⊢ ((𝐴 ∈ No ∧ 𝐴 ≤s 0s ) → (abss‘𝐴) = ( -us ‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0no 28053 | . . . 4 ⊢ 0s ∈ No | |
| 2 | lesloe 27969 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 0s ∈ No ) → (𝐴 ≤s 0s ↔ (𝐴 <s 0s ∨ 𝐴 = 0s ))) | |
| 3 | 1, 2 | mpan2 704 | . . 3 ⊢ (𝐴 ∈ No → (𝐴 ≤s 0s ↔ (𝐴 <s 0s ∨ 𝐴 = 0s ))) |
| 4 | ltnles 27968 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 0s ∈ No ) → (𝐴 <s 0s ↔ ¬ 0s ≤s 𝐴)) | |
| 5 | 1, 4 | mpan2 704 | . . . . 5 ⊢ (𝐴 ∈ No → (𝐴 <s 0s ↔ ¬ 0s ≤s 𝐴)) |
| 6 | abssval 28483 | . . . . . . 7 ⊢ (𝐴 ∈ No → (abss‘𝐴) = if( 0s ≤s 𝐴, 𝐴, ( -us ‘𝐴))) | |
| 7 | iffalse 4498 | . . . . . . 7 ⊢ (¬ 0s ≤s 𝐴 → if( 0s ≤s 𝐴, 𝐴, ( -us ‘𝐴)) = ( -us ‘𝐴)) | |
| 8 | 6, 7 | sylan9eq 2820 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ ¬ 0s ≤s 𝐴) → (abss‘𝐴) = ( -us ‘𝐴)) |
| 9 | 8 | ex 418 | . . . . 5 ⊢ (𝐴 ∈ No → (¬ 0s ≤s 𝐴 → (abss‘𝐴) = ( -us ‘𝐴))) |
| 10 | 5, 9 | sylbid 243 | . . . 4 ⊢ (𝐴 ∈ No → (𝐴 <s 0s → (abss‘𝐴) = ( -us ‘𝐴))) |
| 11 | abs0s 28486 | . . . . . . 7 ⊢ (abss‘ 0s ) = 0s | |
| 12 | neg0s 28270 | . . . . . . 7 ⊢ ( -us ‘ 0s ) = 0s | |
| 13 | 11, 12 | eqtr4i 2791 | . . . . . 6 ⊢ (abss‘ 0s ) = ( -us ‘ 0s ) |
| 14 | fveq2 6885 | . . . . . 6 ⊢ (𝐴 = 0s → (abss‘𝐴) = (abss‘ 0s )) | |
| 15 | fveq2 6885 | . . . . . 6 ⊢ (𝐴 = 0s → ( -us ‘𝐴) = ( -us ‘ 0s )) | |
| 16 | 13, 14, 15 | 3eqtr4a 2826 | . . . . 5 ⊢ (𝐴 = 0s → (abss‘𝐴) = ( -us ‘𝐴)) |
| 17 | 16 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ No → (𝐴 = 0s → (abss‘𝐴) = ( -us ‘𝐴))) |
| 18 | 10, 17 | jaod 873 | . . 3 ⊢ (𝐴 ∈ No → ((𝐴 <s 0s ∨ 𝐴 = 0s ) → (abss‘𝐴) = ( -us ‘𝐴))) |
| 19 | 3, 18 | sylbid 243 | . 2 ⊢ (𝐴 ∈ No → (𝐴 ≤s 0s → (abss‘𝐴) = ( -us ‘𝐴))) |
| 20 | 19 | imp 412 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐴 ≤s 0s ) → (abss‘𝐴) = ( -us ‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2146 ifcif 4489 class class class wbr 5111 ‘cfv 6540 No csur 27855 <s clts 27856 ≤s cles 27959 0s c0s 28049 -us cnegs 28263 absscabss 28481 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-1o 8459 df-2o 8460 df-no 27858 df-lts 27859 df-bday 27860 df-les 27960 df-slts 28002 df-cuts 28004 df-0s 28051 df-made 28071 df-old 28072 df-left 28074 df-right 28075 df-norec 28182 df-negs 28265 df-abss 28482 |
| This theorem is used by: absmuls 28488 absnegs 28491 leabss 28492 |
| Copyright terms: Public domain | W3C validator |