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 11159 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) | |
2 | 1 | oveq1d 7284 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐵 + 𝐴) − 𝐶)) |
3 | 2 | 3adant3 1131 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐵 + 𝐴) − 𝐶)) |
4 | addsubass 11229 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) − 𝐶) = (𝐵 + (𝐴 − 𝐶))) | |
5 | 4 | 3com12 1122 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) − 𝐶) = (𝐵 + (𝐴 − 𝐶))) |
6 | subcl 11218 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − 𝐶) ∈ ℂ) | |
7 | addcom 11159 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ (𝐴 − 𝐶) ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) | |
8 | 6, 7 | sylan2 593 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
9 | 8 | 3impb 1114 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
10 | 9 | 3com12 1122 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
11 | 3, 5, 10 | 3eqtrd 2784 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐴 − 𝐶) + 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1542 ∈ wcel 2110 (class class class)co 7269 ℂcc 10868 + caddc 10873 − cmin 11203 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7580 ax-resscn 10927 ax-1cn 10928 ax-icn 10929 ax-addcl 10930 ax-addrcl 10931 ax-mulcl 10932 ax-mulrcl 10933 ax-mulcom 10934 ax-addass 10935 ax-mulass 10936 ax-distr 10937 ax-i2m1 10938 ax-1ne0 10939 ax-1rid 10940 ax-rnegex 10941 ax-rrecex 10942 ax-cnre 10943 ax-pre-lttri 10944 ax-pre-lttrn 10945 ax-pre-ltadd 10946 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-nel 3052 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5163 df-id 5489 df-po 5503 df-so 5504 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6389 df-fun 6433 df-fn 6434 df-f 6435 df-f1 6436 df-fo 6437 df-f1o 6438 df-fv 6439 df-riota 7226 df-ov 7272 df-oprab 7273 df-mpo 7274 df-er 8479 df-en 8715 df-dom 8716 df-sdom 8717 df-pnf 11010 df-mnf 11011 df-ltxr 11013 df-sub 11205 |
This theorem is referenced by: subadd23 11231 2addsub 11233 nnpcan 11242 subsub 11249 npncan3 11257 addsub4 11262 addsubi 11311 addsubd 11351 muleqadd 11617 nnaddm1cl 12375 modsumfzodifsn 13660 expubnd 13891 cvgrat 15591 omeo 16071 |
Copyright terms: Public domain | W3C validator |