| 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 28453 | . . 3 ⊢ (𝜑 → ( -s‘𝐶) ∈ No) |
| 5 | 1, 2, 4 | adds32d 28423 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) +s ( -s‘𝐶)) = ((𝐴 +s ( -s‘𝐶)) +s 𝐵)) |
| 6 | 1, 2 | addscld 28396 | . . 3 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No) |
| 7 | 6, 3 | subsvald 28477 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) −s 𝐶) = ((𝐴 +s 𝐵) +s ( -s‘𝐶))) |
| 8 | 1, 3 | subsvald 28477 | . . 3 ⊢ (𝜑 → (𝐴 −s 𝐶) = (𝐴 +s ( -s‘𝐶))) |
| 9 | 8 | oveq1d 7458 | . 2 ⊢ (𝜑 → ((𝐴 −s 𝐶) +s 𝐵) = ((𝐴 +s ( -s‘𝐶)) +s 𝐵)) |
| 10 | 5, 7, 9 | 3eqtr4d 2808 | 1 ⊢ (𝜑 → ((𝐴 +s 𝐵) −s 𝐶) = ((𝐴 −s 𝐶) +s 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ‘cfv 6558 (class class class)co 7443 Nocsur 28027 +s cadds 28375 -scnegs 28435 −s csubs 28436 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-ot 4862 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-1o 8504 df-2o 8505 df-nadd 8703 df-no 28030 df-lts 28031 df-bday 28032 df-les 28132 df-slts 28174 df-cuts 28176 df-0s 28223 df-made 28243 df-old 28244 df-left 28246 df-right 28247 df-norec 28354 df-norec2 28365 df-adds 28376 df-negs 28437 df-subs 28438 |
| This theorem is used by: addsubs4d 28517 mulsproplem5 28536 mulsproplem6 28537 mulsproplem7 28538 mulsproplem8 28539 sltmuls1 28563 sltmuls2 28564 mulsuniflem 28565 addsdilem3 28569 addsdilem4 28570 mulsasslem3 28581 mulsunif2lem 28585 zseo 28838 pw2cut2 28878 bdayfinbndlem1 28883 readdscl 28915 |
| Copyright terms: Public domain | W3C validator |