| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subscan2d | Structured version Visualization version GIF version | ||
| Description: Cancellation law for surreal subtraction. (Contributed by Scott Fenton, 7-Nov-2025.) |
| Ref | Expression |
|---|---|
| subscand.1 | ⊢ (𝜑 → 𝐴 ∈ No ) |
| subscand.2 | ⊢ (𝜑 → 𝐵 ∈ No ) |
| subscand.3 | ⊢ (𝜑 → 𝐶 ∈ No ) |
| Ref | Expression |
|---|---|
| subscan2d | ⊢ (𝜑 → ((𝐴 -s 𝐶) = (𝐵 -s 𝐶) ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subscand.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ No ) | |
| 2 | subscand.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ No ) | |
| 3 | 1, 2 | subsvald 28120 | . . 3 ⊢ (𝜑 → (𝐴 -s 𝐶) = (𝐴 +s ( -us ‘𝐶))) |
| 4 | subscand.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ No ) | |
| 5 | 4, 2 | subsvald 28120 | . . 3 ⊢ (𝜑 → (𝐵 -s 𝐶) = (𝐵 +s ( -us ‘𝐶))) |
| 6 | 3, 5 | eqeq12d 2768 | . 2 ⊢ (𝜑 → ((𝐴 -s 𝐶) = (𝐵 -s 𝐶) ↔ (𝐴 +s ( -us ‘𝐶)) = (𝐵 +s ( -us ‘𝐶)))) |
| 7 | 2 | negscld 28096 | . . 3 ⊢ (𝜑 → ( -us ‘𝐶) ∈ No ) |
| 8 | 1, 4, 7 | addscan2d 28058 | . 2 ⊢ (𝜑 → ((𝐴 +s ( -us ‘𝐶)) = (𝐵 +s ( -us ‘𝐶)) ↔ 𝐴 = 𝐵)) |
| 9 | 6, 8 | bitrd 281 | 1 ⊢ (𝜑 → ((𝐴 -s 𝐶) = (𝐵 -s 𝐶) ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 = wceq 1550 ∈ wcel 2132 ‘cfv 6506 (class class class)co 7381 No csur 27670 +s cadds 28018 -us cnegs 28078 -s csubs 28079 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-tp 4577 df-op 4579 df-ot 4581 df-uni 4856 df-int 4896 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-se 5590 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-1o 8421 df-2o 8422 df-nadd 8620 df-no 27673 df-lts 27674 df-bday 27675 df-les 27775 df-slts 27817 df-cuts 27819 df-0s 27866 df-made 27886 df-old 27887 df-left 27889 df-right 27890 df-norec 27997 df-norec2 28008 df-adds 28019 df-negs 28080 df-subs 28081 |
| This theorem is referenced by: subseq0d 28164 |
| Copyright terms: Public domain | W3C validator |