| 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 27979 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 -s 𝐶) +s 𝐶) = 𝐴) | |
| 4 | 1, 2, 3 | syl2anc 584 | . . . 4 ⊢ (𝜑 → ((𝐴 -s 𝐶) +s 𝐶) = 𝐴) |
| 5 | sltsubsubbd.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 6 | npcans 27979 | . . . . 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 27874 | . . . . 5 ⊢ (𝜑 → (𝐵 +s 𝐶) = (𝐶 +s 𝐵)) |
| 10 | 9 | oveq1d 7402 | . . . 4 ⊢ (𝜑 → ((𝐵 +s 𝐶) +s ( -us ‘𝐷)) = ((𝐶 +s 𝐵) +s ( -us ‘𝐷))) |
| 11 | sltsubsubbd.4 | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ No ) | |
| 12 | 5, 11 | subsvald 27965 | . . . . . 6 ⊢ (𝜑 → (𝐵 -s 𝐷) = (𝐵 +s ( -us ‘𝐷))) |
| 13 | 12 | oveq1d 7402 | . . . . 5 ⊢ (𝜑 → ((𝐵 -s 𝐷) +s 𝐶) = ((𝐵 +s ( -us ‘𝐷)) +s 𝐶)) |
| 14 | 11 | negscld 27943 | . . . . . 6 ⊢ (𝜑 → ( -us ‘𝐷) ∈ No ) |
| 15 | 5, 14, 2 | adds32d 27914 | . . . . 5 ⊢ (𝜑 → ((𝐵 +s ( -us ‘𝐷)) +s 𝐶) = ((𝐵 +s 𝐶) +s ( -us ‘𝐷))) |
| 16 | 13, 15 | eqtrd 2764 | . . . 4 ⊢ (𝜑 → ((𝐵 -s 𝐷) +s 𝐶) = ((𝐵 +s 𝐶) +s ( -us ‘𝐷))) |
| 17 | 2, 11 | subsvald 27965 | . . . . . 6 ⊢ (𝜑 → (𝐶 -s 𝐷) = (𝐶 +s ( -us ‘𝐷))) |
| 18 | 17 | oveq1d 7402 | . . . . 5 ⊢ (𝜑 → ((𝐶 -s 𝐷) +s 𝐵) = ((𝐶 +s ( -us ‘𝐷)) +s 𝐵)) |
| 19 | 2, 14, 5 | adds32d 27914 | . . . . 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 5120 | . 2 ⊢ (𝜑 → (((𝐴 -s 𝐶) +s 𝐶) <s ((𝐵 -s 𝐷) +s 𝐶) ↔ ((𝐴 -s 𝐵) +s 𝐵) <s ((𝐶 -s 𝐷) +s 𝐵))) |
| 23 | 1, 2 | subscld 27967 | . . 3 ⊢ (𝜑 → (𝐴 -s 𝐶) ∈ No ) |
| 24 | 5, 11 | subscld 27967 | . . 3 ⊢ (𝜑 → (𝐵 -s 𝐷) ∈ No ) |
| 25 | 23, 24, 2 | sltadd1d 27905 | . 2 ⊢ (𝜑 → ((𝐴 -s 𝐶) <s (𝐵 -s 𝐷) ↔ ((𝐴 -s 𝐶) +s 𝐶) <s ((𝐵 -s 𝐷) +s 𝐶))) |
| 26 | 1, 5 | subscld 27967 | . . 3 ⊢ (𝜑 → (𝐴 -s 𝐵) ∈ No ) |
| 27 | 2, 11 | subscld 27967 | . . 3 ⊢ (𝜑 → (𝐶 -s 𝐷) ∈ No ) |
| 28 | 26, 27, 5 | sltadd1d 27905 | . 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 5107 ‘cfv 6511 (class class class)co 7387 No csur 27551 <s cslt 27552 +s cadds 27866 -us cnegs 27925 -s csubs 27926 |
| 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 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| 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 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-ot 4598 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-1o 8434 df-2o 8435 df-nadd 8630 df-no 27554 df-slt 27555 df-bday 27556 df-sle 27657 df-sslt 27693 df-scut 27695 df-0s 27736 df-made 27755 df-old 27756 df-left 27758 df-right 27759 df-norec 27845 df-norec2 27856 df-adds 27867 df-negs 27927 df-subs 27928 |
| This theorem is referenced by: sltsubsub3bd 27989 slesubsub3bd 27992 mulsproplem6 28024 mulsproplem7 28025 mulsproplem8 28026 |
| Copyright terms: Public domain | W3C validator |