![]() |
Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sltsub2 | Structured version Visualization version GIF version |
Description: Subtraction from both sides of surreal less-than. (Contributed by Scott Fenton, 4-Feb-2025.) |
Ref | Expression |
---|---|
sltsub2 | ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ (𝐶 -s 𝐵) <s (𝐶 -s 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | negscl 34322 | . . . 4 ⊢ (𝐵 ∈ No → ( -us ‘𝐵) ∈ No ) | |
2 | 1 | 3ad2ant2 1134 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ( -us ‘𝐵) ∈ No ) |
3 | negscl 34322 | . . . 4 ⊢ (𝐴 ∈ No → ( -us ‘𝐴) ∈ No ) | |
4 | 3 | 3ad2ant1 1133 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ( -us ‘𝐴) ∈ No ) |
5 | simp3 1138 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐶 ∈ No ) | |
6 | sltadd2 34296 | . . 3 ⊢ ((( -us ‘𝐵) ∈ No ∧ ( -us ‘𝐴) ∈ No ∧ 𝐶 ∈ No ) → (( -us ‘𝐵) <s ( -us ‘𝐴) ↔ (𝐶 +s ( -us ‘𝐵)) <s (𝐶 +s ( -us ‘𝐴)))) | |
7 | 2, 4, 5, 6 | syl3anc 1371 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (( -us ‘𝐵) <s ( -us ‘𝐴) ↔ (𝐶 +s ( -us ‘𝐵)) <s (𝐶 +s ( -us ‘𝐴)))) |
8 | sltneg 34330 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 ↔ ( -us ‘𝐵) <s ( -us ‘𝐴))) | |
9 | 8 | 3adant3 1132 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ ( -us ‘𝐵) <s ( -us ‘𝐴))) |
10 | simp2 1137 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐵 ∈ No ) | |
11 | subsval 34336 | . . . 4 ⊢ ((𝐶 ∈ No ∧ 𝐵 ∈ No ) → (𝐶 -s 𝐵) = (𝐶 +s ( -us ‘𝐵))) | |
12 | 5, 10, 11 | syl2anc 584 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐶 -s 𝐵) = (𝐶 +s ( -us ‘𝐵))) |
13 | simp1 1136 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐴 ∈ No ) | |
14 | subsval 34336 | . . . 4 ⊢ ((𝐶 ∈ No ∧ 𝐴 ∈ No ) → (𝐶 -s 𝐴) = (𝐶 +s ( -us ‘𝐴))) | |
15 | 5, 13, 14 | syl2anc 584 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐶 -s 𝐴) = (𝐶 +s ( -us ‘𝐴))) |
16 | 12, 15 | breq12d 5116 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐶 -s 𝐵) <s (𝐶 -s 𝐴) ↔ (𝐶 +s ( -us ‘𝐵)) <s (𝐶 +s ( -us ‘𝐴)))) |
17 | 7, 9, 16 | 3bitr4d 310 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ (𝐶 -s 𝐵) <s (𝐶 -s 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 class class class wbr 5103 ‘cfv 6493 (class class class)co 7351 No csur 26939 <s cslt 26940 +s cadds 34267 -us cnegs 34306 -s csubs 34307 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-rep 5240 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7664 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-rmo 3351 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-ot 4593 df-uni 4864 df-int 4906 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-se 5587 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6251 df-ord 6318 df-on 6319 df-suc 6321 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7307 df-ov 7354 df-oprab 7355 df-mpo 7356 df-1st 7913 df-2nd 7914 df-frecs 8204 df-wrecs 8235 df-recs 8309 df-1o 8404 df-2o 8405 df-no 26942 df-slt 26943 df-bday 26944 df-sle 27044 df-sslt 27072 df-scut 27074 df-0s 27114 df-made 27128 df-old 27129 df-left 27131 df-right 27132 df-nadd 34215 df-norec 34246 df-norec2 34257 df-adds 34268 df-negs 34308 df-subs 34309 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |