| 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 28045 | . . 3 ⊢ (𝜑 → ( -us ‘𝐶) ∈ No ) |
| 5 | 1, 2, 4 | addsassd 28014 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) +s ( -us ‘𝐶)) = (𝐴 +s (𝐵 +s ( -us ‘𝐶)))) |
| 6 | 1, 2 | addscld 27988 | . . 3 ⊢ (𝜑 → (𝐴 +s 𝐵) ∈ No ) |
| 7 | 6, 3 | subsvald 28069 | . 2 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = ((𝐴 +s 𝐵) +s ( -us ‘𝐶))) |
| 8 | 2, 3 | subsvald 28069 | . . 3 ⊢ (𝜑 → (𝐵 -s 𝐶) = (𝐵 +s ( -us ‘𝐶))) |
| 9 | 8 | oveq2d 7384 | . 2 ⊢ (𝜑 → (𝐴 +s (𝐵 -s 𝐶)) = (𝐴 +s (𝐵 +s ( -us ‘𝐶)))) |
| 10 | 5, 7, 9 | 3eqtr4d 2782 | 1 ⊢ (𝜑 → ((𝐴 +s 𝐵) -s 𝐶) = (𝐴 +s (𝐵 -s 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6500 (class class class)co 7368 No csur 27619 +s cadds 27967 -us cnegs 28027 -s csubs 28028 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-ot 4591 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-1o 8407 df-2o 8408 df-nadd 8604 df-no 27622 df-lts 27623 df-bday 27624 df-les 27725 df-slts 27766 df-cuts 27768 df-0s 27815 df-made 27835 df-old 27836 df-left 27838 df-right 27839 df-norec 27946 df-norec2 27957 df-adds 27968 df-negs 28029 df-subs 28030 |
| This theorem is referenced by: addsubs4d 28109 mulsproplem5 28128 mulsproplem6 28129 mulsproplem7 28130 mulsproplem8 28131 mulsproplem12 28135 mulsuniflem 28157 addsdilem4 28162 mulsasslem3 28173 mulsunif2lem 28177 precsexlem11 28225 n0subs 28371 zseo 28430 readdscl 28507 |
| Copyright terms: Public domain | W3C validator |