| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addsub | Structured version Visualization version GIF version | ||
| Description: Law for addition and subtraction. (Contributed by NM, 19-Aug-2001.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
| Ref | Expression |
|---|---|
| addsub | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐴 − 𝐶) + 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | addcom 11384 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) | |
| 2 | 1 | oveq1d 7415 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐵 + 𝐴) − 𝐶)) |
| 3 | 2 | 3adant3 1148 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐵 + 𝐴) − 𝐶)) |
| 4 | addsubass 11455 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) − 𝐶) = (𝐵 + (𝐴 − 𝐶))) | |
| 5 | 4 | 3com12 1139 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) − 𝐶) = (𝐵 + (𝐴 − 𝐶))) |
| 6 | subcl 11444 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − 𝐶) ∈ ℂ) | |
| 7 | addcom 11384 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ (𝐴 − 𝐶) ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) | |
| 8 | 6, 7 | sylan2 604 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
| 9 | 8 | 3impb 1130 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
| 10 | 9 | 3com12 1139 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
| 11 | 3, 5, 10 | 3eqtrd 2804 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐴 − 𝐶) + 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 (class class class)co 7400 ℂcc 11086 + caddc 11091 − cmin 11429 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-po 5560 df-so 5561 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-ltxr 11236 df-sub 11431 |
| This theorem is referenced by: subadd23 11457 2addsub 11459 nnpcan 11469 subsub 11476 npncan3 11484 addsub4 11489 addsubi 11538 addsubd 11578 muleqadd 11846 nnaddm1cl 12644 modsumfzodifsn 13971 expubnd 14205 cvgrat 15927 omeo 16414 |
| Copyright terms: Public domain | W3C validator |