| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addsubsub23 | Structured version Visualization version GIF version | ||
| Description: Swap the second and the third terms in a difference of a sum and a difference (or, vice versa, in a sum of a difference and a sum). (Contributed by AV, 15-Nov-2025.) |
| Ref | Expression |
|---|---|
| negidd.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| pncand.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| subaddd.3 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| addsub4d.4 | ⊢ (𝜑 → 𝐷 ∈ ℂ) |
| Ref | Expression |
|---|---|
| addsubsub23 | ⊢ (𝜑 → ((𝐴 + 𝐵) − (𝐶 − 𝐷)) = ((𝐴 − 𝐶) + (𝐵 + 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | negidd.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
| 2 | pncand.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | addcld 11335 | . . 3 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℂ) |
| 4 | subaddd.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 5 | addsub4d.4 | . . 3 ⊢ (𝜑 → 𝐷 ∈ ℂ) | |
| 6 | 3, 4, 5 | subsubd 11704 | . 2 ⊢ (𝜑 → ((𝐴 + 𝐵) − (𝐶 − 𝐷)) = (((𝐴 + 𝐵) − 𝐶) + 𝐷)) |
| 7 | 1, 2, 4 | addsubd 11697 | . . 3 ⊢ (𝜑 → ((𝐴 + 𝐵) − 𝐶) = ((𝐴 − 𝐶) + 𝐵)) |
| 8 | 7 | oveq1d 7439 | . 2 ⊢ (𝜑 → (((𝐴 + 𝐵) − 𝐶) + 𝐷) = (((𝐴 − 𝐶) + 𝐵) + 𝐷)) |
| 9 | 1, 4 | subcld 11676 | . . 3 ⊢ (𝜑 → (𝐴 − 𝐶) ∈ ℂ) |
| 10 | 9, 2, 5 | addassd 11338 | . 2 ⊢ (𝜑 → (((𝐴 − 𝐶) + 𝐵) + 𝐷) = ((𝐴 − 𝐶) + (𝐵 + 𝐷))) |
| 11 | 6, 8, 10 | 3eqtrd 2799 | 1 ⊢ (𝜑 → ((𝐴 + 𝐵) − (𝐶 − 𝐷)) = ((𝐴 − 𝐶) + (𝐵 + 𝐷))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 (class class class)co 7424 ℂcc 11205 + caddc 11210 − cmin 11548 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-er 8724 df-en 8981 df-dom 8982 df-sdom 8983 df-pnf 11352 df-mnf 11353 df-ltxr 11355 df-sub 11550 |
| This theorem is used by: sin5tlem5 48031 goldpolyfactor 48035 modmkpkne 48545 |
| Copyright terms: Public domain | W3C validator |