![]() |
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 10540 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) | |
2 | 1 | oveq1d 6919 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐵 + 𝐴) − 𝐶)) |
3 | 2 | 3adant3 1168 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐵 + 𝐴) − 𝐶)) |
4 | addsubass 10611 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) − 𝐶) = (𝐵 + (𝐴 − 𝐶))) | |
5 | 4 | 3com12 1159 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) − 𝐶) = (𝐵 + (𝐴 − 𝐶))) |
6 | subcl 10599 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − 𝐶) ∈ ℂ) | |
7 | addcom 10540 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ (𝐴 − 𝐶) ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) | |
8 | 6, 7 | sylan2 588 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
9 | 8 | 3impb 1149 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
10 | 9 | 3com12 1159 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + (𝐴 − 𝐶)) = ((𝐴 − 𝐶) + 𝐵)) |
11 | 3, 5, 10 | 3eqtrd 2864 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐴 − 𝐶) + 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 ∧ w3a 1113 = wceq 1658 ∈ wcel 2166 (class class class)co 6904 ℂcc 10249 + caddc 10254 − cmin 10584 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-8 2168 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2390 ax-ext 2802 ax-sep 5004 ax-nul 5012 ax-pow 5064 ax-pr 5126 ax-un 7208 ax-resscn 10308 ax-1cn 10309 ax-icn 10310 ax-addcl 10311 ax-addrcl 10312 ax-mulcl 10313 ax-mulrcl 10314 ax-mulcom 10315 ax-addass 10316 ax-mulass 10317 ax-distr 10318 ax-i2m1 10319 ax-1ne0 10320 ax-1rid 10321 ax-rnegex 10322 ax-rrecex 10323 ax-cnre 10324 ax-pre-lttri 10325 ax-pre-lttrn 10326 ax-pre-ltadd 10327 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3or 1114 df-3an 1115 df-tru 1662 df-ex 1881 df-nf 1885 df-sb 2070 df-mo 2604 df-eu 2639 df-clab 2811 df-cleq 2817 df-clel 2820 df-nfc 2957 df-ne 2999 df-nel 3102 df-ral 3121 df-rex 3122 df-reu 3123 df-rab 3125 df-v 3415 df-sbc 3662 df-csb 3757 df-dif 3800 df-un 3802 df-in 3804 df-ss 3811 df-nul 4144 df-if 4306 df-pw 4379 df-sn 4397 df-pr 4399 df-op 4403 df-uni 4658 df-br 4873 df-opab 4935 df-mpt 4952 df-id 5249 df-po 5262 df-so 5263 df-xp 5347 df-rel 5348 df-cnv 5349 df-co 5350 df-dm 5351 df-rn 5352 df-res 5353 df-ima 5354 df-iota 6085 df-fun 6124 df-fn 6125 df-f 6126 df-f1 6127 df-fo 6128 df-f1o 6129 df-fv 6130 df-riota 6865 df-ov 6907 df-oprab 6908 df-mpt2 6909 df-er 8008 df-en 8222 df-dom 8223 df-sdom 8224 df-pnf 10392 df-mnf 10393 df-ltxr 10395 df-sub 10586 |
This theorem is referenced by: subadd23 10613 2addsub 10615 nnpcan 10624 subsub 10631 npncan3 10639 addsub4 10644 addsubi 10693 addsubd 10733 muleqadd 10995 nnaddm1cl 11761 modsumfzodifsn 13037 expubnd 13214 cvgrat 14987 omeo 15463 |
Copyright terms: Public domain | W3C validator |