| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addsubsassd | Structured version Visualization version GIF version | ||
| Description: Associative-type law for surreal addition and subtraction. (Contributed by Scott Fenton, 6-Feb-2025.) |
| Ref | Expression |
|---|---|
| addsubsassd.1 | ⊢ (𝜑 → 𝐴 ∈ No ) |
| addsubsassd.2 | ⊢ (𝜑 → 𝐵 ∈ No ) |
| addsubsassd.3 | ⊢ (𝜑 → 𝐶 ∈ No ) |
| Ref | Expression |
|---|---|
| addsubsassd | ⊢ (𝜑 → ((𝐴 +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 28188 | . . 3 ⊢ (𝜑 → ( -us ‘𝐶) ∈ No ) |
| 5 | 1, 2, 4 | addsassd 28157 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) +s ( -us ‘𝐶)) = (𝐴 +s (𝐵 +s ( -us ‘𝐶)))) |
| 6 | 1, 2 | addscld 28131 | . . 3 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No ) |
| 7 | 6, 3 | subsvald 28212 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = ((𝐴 +s 𝐵) +s ( -us ‘𝐶))) |
| 8 | 2, 3 | subsvald 28212 | . . 3 ⊢ (𝜑 → (𝐵 -s 𝐶) = (𝐵 +s ( -us ‘𝐶))) |
| 9 | 8 | oveq2d 7416 | . 2 ⊢ (𝜑 → (𝐴 +s (𝐵 -s 𝐶)) = (𝐴 +s (𝐵 +s ( -us ‘𝐶)))) |
| 10 | 5, 7, 9 | 3eqtr4d 2810 | 1 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = (𝐴 +s (𝐵 -s 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 ‘cfv 6525 (class class class)co 7400 No csur 27762 +s cadds 28110 -us cnegs 28170 -s csubs 28171 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-ot 4594 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-se 5606 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-1o 8441 df-2o 8442 df-nadd 8640 df-no 27765 df-lts 27766 df-bday 27767 df-les 27867 df-slts 27909 df-cuts 27911 df-0s 27958 df-made 27978 df-old 27979 df-left 27981 df-right 27982 df-norec 28089 df-norec2 28100 df-adds 28111 df-negs 28172 df-subs 28173 |
| This theorem is referenced by: addsubs4d 28252 mulsproplem5 28271 mulsproplem6 28272 mulsproplem7 28273 mulsproplem8 28274 mulsproplem12 28278 mulsuniflem 28300 addsdilem4 28305 mulsasslem3 28316 mulsunif2lem 28320 precsexlem11 28368 n0subs 28514 zseo 28573 readdscl 28650 |
| Copyright terms: Public domain | W3C validator |