| 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 28424 | . . 3 ⊢ (𝜑 → ( -s‘𝐶) ∈ No) |
| 5 | 1, 2, 4 | adds32d 28394 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) +s ( -s‘𝐶)) = ((𝐴 +s ( -s‘𝐶)) +s 𝐵)) |
| 6 | 1, 2 | addscld 28367 | . . 3 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No) |
| 7 | 6, 3 | subsvald 28448 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) −s 𝐶) = ((𝐴 +s 𝐵) +s ( -s‘𝐶))) |
| 8 | 1, 3 | subsvald 28448 | . . 3 ⊢ (𝜑 → (𝐴 −s 𝐶) = (𝐴 +s ( -s‘𝐶))) |
| 9 | 8 | oveq1d 7435 | . 2 ⊢ (𝜑 → ((𝐴 −s 𝐶) +s 𝐵) = ((𝐴 +s ( -s‘𝐶)) +s 𝐵)) |
| 10 | 5, 7, 9 | 3eqtr4d 2805 | 1 ⊢ (𝜑 → ((𝐴 +s 𝐵) −s 𝐶) = ((𝐴 −s 𝐶) +s 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ‘cfv 6538 (class class class)co 7420 Nocsur 27998 +s cadds 28346 -scnegs 28406 −s csubs 28407 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-tp 4588 df-op 4590 df-ot 4592 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-1o 8477 df-2o 8478 df-nadd 8676 df-no 28001 df-lts 28002 df-bday 28003 df-les 28103 df-slts 28145 df-cuts 28147 df-0s 28194 df-made 28214 df-old 28215 df-left 28217 df-right 28218 df-norec 28325 df-norec2 28336 df-adds 28347 df-negs 28408 df-subs 28409 |
| This theorem is used by: addsubs4d 28488 mulsproplem5 28507 mulsproplem6 28508 mulsproplem7 28509 mulsproplem8 28510 sltmuls1 28534 sltmuls2 28535 mulsuniflem 28536 addsdilem3 28540 addsdilem4 28541 mulsasslem3 28552 mulsunif2lem 28556 zseo 28809 pw2cut2 28849 bdayfinbndlem1 28854 readdscl 28886 |
| Copyright terms: Public domain | W3C validator |