| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltmulnegs1d | Structured version Visualization version GIF version | ||
| Description: Multiplication of both sides of surreal less-than by a negative number. (Contributed by Scott Fenton, 14-Mar-2025.) |
| Ref | Expression |
|---|---|
| ltmulnegs.1 | ⊢ (𝜑 → 𝐴 ∈ No) |
| ltmulnegs.2 | ⊢ (𝜑 → 𝐵 ∈ No) |
| ltmulnegs.3 | ⊢ (𝜑 → 𝐶 ∈ No) |
| ltmulnegs.4 | ⊢ (𝜑 → 𝐶 <s 0s ) |
| Ref | Expression |
|---|---|
| ltmulnegs1d | ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐵 ·s 𝐶) <s (𝐴 ·s 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltmulnegs.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ No) | |
| 2 | ltmulnegs.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ No) | |
| 3 | 1, 2 | mulnegs2d 28559 | . . 3 ⊢ (𝜑 → (𝐴 ·s ( -s‘𝐶)) = ( -s‘(𝐴 ·s 𝐶))) |
| 4 | ltmulnegs.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ No) | |
| 5 | 4, 2 | mulnegs2d 28559 | . . 3 ⊢ (𝜑 → (𝐵 ·s ( -s‘𝐶)) = ( -s‘(𝐵 ·s 𝐶))) |
| 6 | 3, 5 | breq12d 5118 | . 2 ⊢ (𝜑 → ((𝐴 ·s ( -s‘𝐶)) <s (𝐵 ·s ( -s‘𝐶)) ↔ ( -s‘(𝐴 ·s 𝐶)) <s ( -s‘(𝐵 ·s 𝐶)))) |
| 7 | 2 | negscld 28435 | . . 3 ⊢ (𝜑 → ( -s‘𝐶) ∈ No) |
| 8 | neg0s 28424 | . . . 4 ⊢ ( -s‘ 0s ) = 0s | |
| 9 | ltmulnegs.4 | . . . . 5 ⊢ (𝜑 → 𝐶 <s 0s ) | |
| 10 | 0no 28207 | . . . . . . 7 ⊢ 0s ∈ No | |
| 11 | 10 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 0s ∈ No) |
| 12 | 2, 11 | ltnegsd 28445 | . . . . 5 ⊢ (𝜑 → (𝐶 <s 0s ↔ ( -s‘ 0s ) <s ( -s‘𝐶))) |
| 13 | 9, 12 | mpbid 235 | . . . 4 ⊢ (𝜑 → ( -s‘ 0s ) <s ( -s‘𝐶)) |
| 14 | 8, 13 | eqbrtrrid 5143 | . . 3 ⊢ (𝜑 → 0s <s ( -s‘𝐶)) |
| 15 | 1, 4, 7, 14 | ltmuls1d 28571 | . 2 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 ·s ( -s‘𝐶)) <s (𝐵 ·s ( -s‘𝐶)))) |
| 16 | 4, 2 | mulscld 28533 | . . 3 ⊢ (𝜑 → (𝐵 ·s 𝐶) ∈ No) |
| 17 | 1, 2 | mulscld 28533 | . . 3 ⊢ (𝜑 → (𝐴 ·s 𝐶) ∈ No) |
| 18 | 16, 17 | ltnegsd 28445 | . 2 ⊢ (𝜑 → ((𝐵 ·s 𝐶) <s (𝐴 ·s 𝐶) ↔ ( -s‘(𝐴 ·s 𝐶)) <s ( -s‘(𝐵 ·s 𝐶)))) |
| 19 | 6, 15, 18 | 3bitr4d 314 | 1 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐵 ·s 𝐶) <s (𝐴 ·s 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∈ wcel 2146 class class class wbr 5105 ‘cfv 6546 (class class class)co 7427 Nocsur 28009 <s clts 28010 0s c0s 28203 -scnegs 28417 ·s cmuls 28504 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4838 df-ot 4861 df-uni 4870 df-int 4910 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-se 5608 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-1o 8487 df-2o 8488 df-nadd 8686 df-no 28012 df-lts 28013 df-bday 28014 df-les 28114 df-slts 28156 df-cuts 28158 df-0s 28205 df-made 28225 df-old 28226 df-left 28228 df-right 28229 df-norec 28336 df-norec2 28347 df-adds 28358 df-negs 28419 df-subs 28420 df-muls 28505 |
| This theorem is used by: ltmulnegs2d 28575 |
| Copyright terms: Public domain | W3C validator |