![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 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 28045 | . . . 4 ⊢ (𝐵 ∈ No → ( -us ‘𝐵) ∈ No ) | |
2 | 1 | 3ad2ant2 1131 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ( -us ‘𝐵) ∈ No ) |
3 | negscl 28045 | . . . 4 ⊢ (𝐴 ∈ No → ( -us ‘𝐴) ∈ No ) | |
4 | 3 | 3ad2ant1 1130 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ( -us ‘𝐴) ∈ No ) |
5 | simp3 1135 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐶 ∈ No ) | |
6 | 2, 4, 5 | sltadd2d 28011 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (( -us ‘𝐵) <s ( -us ‘𝐴) ↔ (𝐶 +s ( -us ‘𝐵)) <s (𝐶 +s ( -us ‘𝐴)))) |
7 | sltneg 28054 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 ↔ ( -us ‘𝐵) <s ( -us ‘𝐴))) | |
8 | 7 | 3adant3 1129 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ ( -us ‘𝐵) <s ( -us ‘𝐴))) |
9 | simp2 1134 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐵 ∈ No ) | |
10 | 5, 9 | subsvald 28068 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐶 -s 𝐵) = (𝐶 +s ( -us ‘𝐵))) |
11 | simp1 1133 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐴 ∈ No ) | |
12 | 5, 11 | subsvald 28068 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐶 -s 𝐴) = (𝐶 +s ( -us ‘𝐴))) |
13 | 10, 12 | breq12d 5166 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐶 -s 𝐵) <s (𝐶 -s 𝐴) ↔ (𝐶 +s ( -us ‘𝐵)) <s (𝐶 +s ( -us ‘𝐴)))) |
14 | 6, 8, 13 | 3bitr4d 310 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 <s 𝐵 ↔ (𝐶 -s 𝐵) <s (𝐶 -s 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1084 ∈ wcel 2099 class class class wbr 5153 ‘cfv 6554 (class class class)co 7424 No csur 27669 <s cslt 27670 +s cadds 27973 -us cnegs 28029 -s csubs 28030 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5290 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-tp 4638 df-op 4640 df-ot 4642 df-uni 4914 df-int 4955 df-iun 5003 df-br 5154 df-opab 5216 df-mpt 5237 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-se 5638 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6312 df-ord 6379 df-on 6380 df-suc 6382 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-1st 8003 df-2nd 8004 df-frecs 8296 df-wrecs 8327 df-recs 8401 df-1o 8496 df-2o 8497 df-nadd 8696 df-no 27672 df-slt 27673 df-bday 27674 df-sle 27775 df-sslt 27811 df-scut 27813 df-0s 27854 df-made 27871 df-old 27872 df-left 27874 df-right 27875 df-norec 27952 df-norec2 27963 df-adds 27974 df-negs 28031 df-subs 28032 |
This theorem is referenced by: sltsub2d 28086 |
Copyright terms: Public domain | W3C validator |