| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sltsubsubbd | Structured version Visualization version GIF version | ||
| Description: Equivalence for the surreal less-than relationship between differences. (Contributed by Scott Fenton, 6-Feb-2025.) |
| Ref | Expression |
|---|---|
| sltsubsubbd.1 | ⊢ (𝜑 → 𝐴 ∈ No ) |
| sltsubsubbd.2 | ⊢ (𝜑 → 𝐵 ∈ No ) |
| sltsubsubbd.3 | ⊢ (𝜑 → 𝐶 ∈ No ) |
| sltsubsubbd.4 | ⊢ (𝜑 → 𝐷 ∈ No ) |
| Ref | Expression |
|---|---|
| sltsubsubbd | ⊢ (𝜑 → ((𝐴 -s 𝐶) <s (𝐵 -s 𝐷) ↔ (𝐴 -s 𝐵) <s (𝐶 -s 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sltsubsubbd.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | sltsubsubbd.3 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ No ) | |
| 3 | npcans 27984 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 -s 𝐶) +s 𝐶) = 𝐴) | |
| 4 | 1, 2, 3 | syl2anc 584 | . . . 4 ⊢ (𝜑 → ((𝐴 -s 𝐶) +s 𝐶) = 𝐴) |
| 5 | sltsubsubbd.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 6 | npcans 27984 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → ((𝐴 -s 𝐵) +s 𝐵) = 𝐴) | |
| 7 | 1, 5, 6 | syl2anc 584 | . . . 4 ⊢ (𝜑 → ((𝐴 -s 𝐵) +s 𝐵) = 𝐴) |
| 8 | 4, 7 | eqtr4d 2767 | . . 3 ⊢ (𝜑 → ((𝐴 -s 𝐶) +s 𝐶) = ((𝐴 -s 𝐵) +s 𝐵)) |
| 9 | 5, 2 | addscomd 27879 | . . . . 5 ⊢ (𝜑 → (𝐵 +s 𝐶) = (𝐶 +s 𝐵)) |
| 10 | 9 | oveq1d 7364 | . . . 4 ⊢ (𝜑 → ((𝐵 +s 𝐶) +s ( -us ‘𝐷)) = ((𝐶 +s 𝐵) +s ( -us ‘𝐷))) |
| 11 | sltsubsubbd.4 | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ No ) | |
| 12 | 5, 11 | subsvald 27970 | . . . . . 6 ⊢ (𝜑 → (𝐵 -s 𝐷) = (𝐵 +s ( -us ‘𝐷))) |
| 13 | 12 | oveq1d 7364 | . . . . 5 ⊢ (𝜑 → ((𝐵 -s 𝐷) +s 𝐶) = ((𝐵 +s ( -us ‘𝐷)) +s 𝐶)) |
| 14 | 11 | negscld 27948 | . . . . . 6 ⊢ (𝜑 → ( -us ‘𝐷) ∈ No ) |
| 15 | 5, 14, 2 | adds32d 27919 | . . . . 5 ⊢ (𝜑 → ((𝐵 +s ( -us ‘𝐷)) +s 𝐶) = ((𝐵 +s 𝐶) +s ( -us ‘𝐷))) |
| 16 | 13, 15 | eqtrd 2764 | . . . 4 ⊢ (𝜑 → ((𝐵 -s 𝐷) +s 𝐶) = ((𝐵 +s 𝐶) +s ( -us ‘𝐷))) |
| 17 | 2, 11 | subsvald 27970 | . . . . . 6 ⊢ (𝜑 → (𝐶 -s 𝐷) = (𝐶 +s ( -us ‘𝐷))) |
| 18 | 17 | oveq1d 7364 | . . . . 5 ⊢ (𝜑 → ((𝐶 -s 𝐷) +s 𝐵) = ((𝐶 +s ( -us ‘𝐷)) +s 𝐵)) |
| 19 | 2, 14, 5 | adds32d 27919 | . . . . 5 ⊢ (𝜑 → ((𝐶 +s ( -us ‘𝐷)) +s 𝐵) = ((𝐶 +s 𝐵) +s ( -us ‘𝐷))) |
| 20 | 18, 19 | eqtrd 2764 | . . . 4 ⊢ (𝜑 → ((𝐶 -s 𝐷) +s 𝐵) = ((𝐶 +s 𝐵) +s ( -us ‘𝐷))) |
| 21 | 10, 16, 20 | 3eqtr4d 2774 | . . 3 ⊢ (𝜑 → ((𝐵 -s 𝐷) +s 𝐶) = ((𝐶 -s 𝐷) +s 𝐵)) |
| 22 | 8, 21 | breq12d 5105 | . 2 ⊢ (𝜑 → (((𝐴 -s 𝐶) +s 𝐶) <s ((𝐵 -s 𝐷) +s 𝐶) ↔ ((𝐴 -s 𝐵) +s 𝐵) <s ((𝐶 -s 𝐷) +s 𝐵))) |
| 23 | 1, 2 | subscld 27972 | . . 3 ⊢ (𝜑 → (𝐴 -s 𝐶) ∈ No ) |
| 24 | 5, 11 | subscld 27972 | . . 3 ⊢ (𝜑 → (𝐵 -s 𝐷) ∈ No ) |
| 25 | 23, 24, 2 | sltadd1d 27910 | . 2 ⊢ (𝜑 → ((𝐴 -s 𝐶) <s (𝐵 -s 𝐷) ↔ ((𝐴 -s 𝐶) +s 𝐶) <s ((𝐵 -s 𝐷) +s 𝐶))) |
| 26 | 1, 5 | subscld 27972 | . . 3 ⊢ (𝜑 → (𝐴 -s 𝐵) ∈ No ) |
| 27 | 2, 11 | subscld 27972 | . . 3 ⊢ (𝜑 → (𝐶 -s 𝐷) ∈ No ) |
| 28 | 26, 27, 5 | sltadd1d 27910 | . 2 ⊢ (𝜑 → ((𝐴 -s 𝐵) <s (𝐶 -s 𝐷) ↔ ((𝐴 -s 𝐵) +s 𝐵) <s ((𝐶 -s 𝐷) +s 𝐵))) |
| 29 | 22, 25, 28 | 3bitr4d 311 | 1 ⊢ (𝜑 → ((𝐴 -s 𝐶) <s (𝐵 -s 𝐷) ↔ (𝐴 -s 𝐵) <s (𝐶 -s 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 class class class wbr 5092 ‘cfv 6482 (class class class)co 7349 No csur 27549 <s cslt 27550 +s cadds 27871 -us cnegs 27930 -s csubs 27931 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-ot 4586 df-uni 4859 df-int 4897 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-1st 7924 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-1o 8388 df-2o 8389 df-nadd 8584 df-no 27552 df-slt 27553 df-bday 27554 df-sle 27655 df-sslt 27692 df-scut 27694 df-0s 27738 df-made 27757 df-old 27758 df-left 27760 df-right 27761 df-norec 27850 df-norec2 27861 df-adds 27872 df-negs 27932 df-subs 27933 |
| This theorem is referenced by: sltsubsub3bd 27994 slesubsub3bd 27997 mulsproplem6 28029 mulsproplem7 28030 mulsproplem8 28031 |
| Copyright terms: Public domain | W3C validator |