| 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 28054 | . . 3 ⊢ (𝜑 → ( -us ‘𝐶) ∈ No ) |
| 5 | 1, 2, 4 | addsassd 28023 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) +s ( -us ‘𝐶)) = (𝐴 +s (𝐵 +s ( -us ‘𝐶)))) |
| 6 | 1, 2 | addscld 27997 | . . 3 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No ) |
| 7 | 6, 3 | subsvald 28078 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = ((𝐴 +s 𝐵) +s ( -us ‘𝐶))) |
| 8 | 2, 3 | subsvald 28078 | . . 3 ⊢ (𝜑 → (𝐵 -s 𝐶) = (𝐵 +s ( -us ‘𝐶))) |
| 9 | 8 | oveq2d 7379 | . 2 ⊢ (𝜑 → (𝐴 +s (𝐵 -s 𝐶)) = (𝐴 +s (𝐵 +s ( -us ‘𝐶)))) |
| 10 | 5, 7, 9 | 3eqtr4d 2785 | 1 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = (𝐴 +s (𝐵 -s 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 ‘cfv 6492 (class class class)co 7363 No csur 27628 +s cadds 27976 -us cnegs 28036 -s csubs 28037 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-tp 4567 df-op 4569 df-ot 4571 df-uni 4846 df-int 4885 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-1o 8402 df-2o 8403 df-nadd 8599 df-no 27631 df-lts 27632 df-bday 27633 df-les 27734 df-slts 27775 df-cuts 27777 df-0s 27824 df-made 27844 df-old 27845 df-left 27847 df-right 27848 df-norec 27955 df-norec2 27966 df-adds 27977 df-negs 28038 df-subs 28039 |
| This theorem is referenced by: addsubs4d 28118 mulsproplem5 28137 mulsproplem6 28138 mulsproplem7 28139 mulsproplem8 28140 mulsproplem12 28144 mulsuniflem 28166 addsdilem4 28171 mulsasslem3 28182 mulsunif2lem 28186 precsexlem11 28234 n0subs 28380 zseo 28439 readdscl 28516 |
| Copyright terms: Public domain | W3C validator |