![]() |
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 27948 | . . 3 ⊢ (𝜑 → ( -us ‘𝐶) ∈ No ) |
5 | 1, 2, 4 | addsassd 27922 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) +s ( -us ‘𝐶)) = (𝐴 +s (𝐵 +s ( -us ‘𝐶)))) |
6 | 1, 2 | addscld 27896 | . . 3 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No ) |
7 | 6, 3 | subsvald 27970 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = ((𝐴 +s 𝐵) +s ( -us ‘𝐶))) |
8 | 2, 3 | subsvald 27970 | . . 3 ⊢ (𝜑 → (𝐵 -s 𝐶) = (𝐵 +s ( -us ‘𝐶))) |
9 | 8 | oveq2d 7436 | . 2 ⊢ (𝜑 → (𝐴 +s (𝐵 -s 𝐶)) = (𝐴 +s (𝐵 +s ( -us ‘𝐶)))) |
10 | 5, 7, 9 | 3eqtr4d 2778 | 1 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = (𝐴 +s (𝐵 -s 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1534 ∈ wcel 2099 ‘cfv 6548 (class class class)co 7420 No csur 27572 +s cadds 27875 -us cnegs 27931 -s csubs 27932 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-rmo 3373 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-ot 4638 df-uni 4909 df-int 4950 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-se 5634 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6305 df-ord 6372 df-on 6373 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7376 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 7993 df-2nd 7994 df-frecs 8286 df-wrecs 8317 df-recs 8391 df-1o 8486 df-2o 8487 df-nadd 8686 df-no 27575 df-slt 27576 df-bday 27577 df-sle 27677 df-sslt 27713 df-scut 27715 df-0s 27756 df-made 27773 df-old 27774 df-left 27776 df-right 27777 df-norec 27854 df-norec2 27865 df-adds 27876 df-negs 27933 df-subs 27934 |
This theorem is referenced by: mulsproplem5 28019 mulsproplem6 28020 mulsproplem7 28021 mulsproplem8 28022 mulsproplem12 28026 mulsuniflem 28048 addsdilem4 28053 mulsasslem3 28064 mulsunif2lem 28068 precsexlem11 28114 readdscl 28226 |
Copyright terms: Public domain | W3C validator |