| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sltsub1 | Structured version Visualization version GIF version | ||
| Description: Subtraction from both sides of surreal less-than. (Contributed by Scott Fenton, 4-Feb-2025.) |
| Ref | Expression |
|---|---|
| sltsub1 | ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ (𝐴 -s 𝐶) <s (𝐵 -s 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | negscl 28018 | . . 3 ⊢ (𝐶 ∈ No → ( -us ‘𝐶) ∈ No ) | |
| 2 | sltadd1 27974 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ ( -us ‘𝐶) ∈ No ) → (𝐴 <s 𝐵 ↔ (𝐴 +s ( -us ‘𝐶)) <s (𝐵 +s ( -us ‘𝐶)))) | |
| 3 | 1, 2 | syl3an3 1166 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ (𝐴 +s ( -us ‘𝐶)) <s (𝐵 +s ( -us ‘𝐶)))) |
| 4 | subsval 28042 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 -s 𝐶) = (𝐴 +s ( -us ‘𝐶))) | |
| 5 | 4 | 3adant2 1132 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 -s 𝐶) = (𝐴 +s ( -us ‘𝐶))) |
| 6 | subsval 28042 | . . . 4 ⊢ ((𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 -s 𝐶) = (𝐵 +s ( -us ‘𝐶))) | |
| 7 | 6 | 3adant1 1131 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 -s 𝐶) = (𝐵 +s ( -us ‘𝐶))) |
| 8 | 5, 7 | breq12d 5112 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 -s 𝐶) <s (𝐵 -s 𝐶) ↔ (𝐴 +s ( -us ‘𝐶)) <s (𝐵 +s ( -us ‘𝐶)))) |
| 9 | 3, 8 | bitr4d 282 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ (𝐴 -s 𝐶) <s (𝐵 -s 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5099 ‘cfv 6493 (class class class)co 7360 No csur 27611 <s cslt 27612 +s cadds 27941 -us cnegs 28001 -s csubs 28002 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-ot 4590 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-1o 8399 df-2o 8400 df-nadd 8596 df-no 27614 df-slt 27615 df-bday 27616 df-sle 27717 df-sslt 27758 df-scut 27760 df-0s 27805 df-made 27825 df-old 27826 df-left 27828 df-right 27829 df-norec 27920 df-norec2 27931 df-adds 27942 df-negs 28003 df-subs 28004 |
| This theorem is referenced by: sltsub1d 28060 |
| Copyright terms: Public domain | W3C validator |