| 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 28241 | . . 3 ⊢ (𝜑 → (𝐴 ·s ( -us ‘𝐶)) = ( -us ‘(𝐴 ·s 𝐶))) |
| 4 | ltmulnegs.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 5 | 4, 2 | mulnegs2d 28241 | . . 3 ⊢ (𝜑 → (𝐵 ·s ( -us ‘𝐶)) = ( -us ‘(𝐵 ·s 𝐶))) |
| 6 | 3, 5 | breq12d 5110 | . 2 ⊢ (𝜑 → ((𝐴 ·s ( -us ‘𝐶)) <s (𝐵 ·s ( -us ‘𝐶)) ↔ ( -us ‘(𝐴 ·s 𝐶)) <s ( -us ‘(𝐵 ·s 𝐶)))) |
| 7 | 2 | negscld 28117 | . . 3 ⊢ (𝜑 → ( -us ‘𝐶) ∈ No ) |
| 8 | neg0s 28106 | . . . 4 ⊢ ( -us ‘ 0s ) = 0s | |
| 9 | ltmulnegs.4 | . . . . 5 ⊢ (𝜑 → 𝐶 <s 0s ) | |
| 10 | 0no 27889 | . . . . . . 7 ⊢ 0s ∈ No | |
| 11 | 10 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 0s ∈ No ) |
| 12 | 2, 11 | ltnegsd 28127 | . . . . 5 ⊢ (𝜑 → (𝐶 <s 0s ↔ ( -us ‘ 0s ) <s ( -us ‘𝐶))) |
| 13 | 9, 12 | mpbid 234 | . . . 4 ⊢ (𝜑 → ( -us ‘ 0s ) <s ( -us ‘𝐶)) |
| 14 | 8, 13 | eqbrtrrid 5133 | . . 3 ⊢ (𝜑 → 0s <s ( -us ‘𝐶)) |
| 15 | 1, 4, 7, 14 | ltmuls1d 28253 | . 2 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐴 ·s ( -us ‘𝐶)) <s (𝐵 ·s ( -us ‘𝐶)))) |
| 16 | 4, 2 | mulscld 28215 | . . 3 ⊢ (𝜑 → (𝐵 ·s 𝐶) ∈ No ) |
| 17 | 1, 2 | mulscld 28215 | . . 3 ⊢ (𝜑 → (𝐴 ·s 𝐶) ∈ No ) |
| 18 | 16, 17 | ltnegsd 28127 | . 2 ⊢ (𝜑 → ((𝐵 ·s 𝐶) <s (𝐴 ·s 𝐶) ↔ ( -us ‘(𝐴 ·s 𝐶)) <s ( -us ‘(𝐵 ·s 𝐶)))) |
| 19 | 6, 15, 18 | 3bitr4d 313 | 1 ⊢ (𝜑 → (𝐴 <s 𝐵 ↔ (𝐵 ·s 𝐶) <s (𝐴 ·s 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∈ wcel 2141 class class class wbr 5097 ‘cfv 6515 (class class class)co 7390 No csur 27691 <s clts 27692 0s c0s 27885 -us cnegs 28099 ·s cmuls 28186 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 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 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-ot 4588 df-uni 4863 df-int 4903 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-se 5597 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-1o 8430 df-2o 8431 df-nadd 8629 df-no 27694 df-lts 27695 df-bday 27696 df-les 27796 df-slts 27838 df-cuts 27840 df-0s 27887 df-made 27907 df-old 27908 df-left 27910 df-right 27911 df-norec 28018 df-norec2 28029 df-adds 28040 df-negs 28101 df-subs 28102 df-muls 28187 |
| This theorem is referenced by: ltmulnegs2d 28257 |
| Copyright terms: Public domain | W3C validator |