| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addsubsd | Structured version Visualization version GIF version | ||
| Description: Law for surreal addition and subtraction. (Contributed by Scott Fenton, 4-Mar-2025.) |
| Ref | Expression |
|---|---|
| addsubsassd.1 | ⊢ (𝜑 → 𝐴 ∈ No ) |
| addsubsassd.2 | ⊢ (𝜑 → 𝐵 ∈ No ) |
| addsubsassd.3 | ⊢ (𝜑 → 𝐶 ∈ No ) |
| Ref | Expression |
|---|---|
| addsubsd | ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = ((𝐴 -s 𝐶) +s 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | addsubsassd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | addsubsassd.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 3 | addsubsassd.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ No ) | |
| 4 | 3 | negscld 28303 | . . 3 ⊢ (𝜑 → ( -us ‘𝐶) ∈ No ) |
| 5 | 1, 2, 4 | adds32d 28273 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) +s ( -us ‘𝐶)) = ((𝐴 +s ( -us ‘𝐶)) +s 𝐵)) |
| 6 | 1, 2 | addscld 28246 | . . 3 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No ) |
| 7 | 6, 3 | subsvald 28327 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = ((𝐴 +s 𝐵) +s ( -us ‘𝐶))) |
| 8 | 1, 3 | subsvald 28327 | . . 3 ⊢ (𝜑 → (𝐴 -s 𝐶) = (𝐴 +s ( -us ‘𝐶))) |
| 9 | 8 | oveq1d 7431 | . 2 ⊢ (𝜑 → ((𝐴 -s 𝐶) +s 𝐵) = ((𝐴 +s ( -us ‘𝐶)) +s 𝐵)) |
| 10 | 5, 7, 9 | 3eqtr4d 2807 | 1 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = ((𝐴 -s 𝐶) +s 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ‘cfv 6537 (class class class)co 7416 No csur 27877 +s cadds 28225 -us cnegs 28285 -s csubs 28286 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-ot 4596 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-1o 8458 df-2o 8459 df-nadd 8657 df-no 27880 df-lts 27881 df-bday 27882 df-les 27982 df-slts 28024 df-cuts 28026 df-0s 28073 df-made 28093 df-old 28094 df-left 28096 df-right 28097 df-norec 28204 df-norec2 28215 df-adds 28226 df-negs 28287 df-subs 28288 |
| This theorem is used by: addsubs4d 28367 mulsproplem5 28386 mulsproplem6 28387 mulsproplem7 28388 mulsproplem8 28389 sltmuls1 28413 sltmuls2 28414 mulsuniflem 28415 addsdilem3 28419 addsdilem4 28420 mulsasslem3 28431 mulsunif2lem 28435 zseo 28688 pw2cut2 28728 bdayfinbndlem1 28733 readdscl 28765 |
| Copyright terms: Public domain | W3C validator |