| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addcan2 | Structured version Visualization version GIF version | ||
| Description: Cancellation law for addition. (Contributed by NM, 30-Jul-2004.) (Revised by Scott Fenton, 3-Jan-2013.) |
| Ref | Expression |
|---|---|
| addcan2 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐶) = (𝐵 + 𝐶) ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnegex 11286 | . . 3 ⊢ (𝐶 ∈ ℂ → ∃𝑥 ∈ ℂ (𝐶 + 𝑥) = 0) | |
| 2 | 1 | 3ad2ant3 1135 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ∃𝑥 ∈ ℂ (𝐶 + 𝑥) = 0) |
| 3 | oveq1 7348 | . . . 4 ⊢ ((𝐴 + 𝐶) = (𝐵 + 𝐶) → ((𝐴 + 𝐶) + 𝑥) = ((𝐵 + 𝐶) + 𝑥)) | |
| 4 | simpl1 1192 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → 𝐴 ∈ ℂ) | |
| 5 | simpl3 1194 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → 𝐶 ∈ ℂ) | |
| 6 | simprl 770 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → 𝑥 ∈ ℂ) | |
| 7 | 4, 5, 6 | addassd 11126 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → ((𝐴 + 𝐶) + 𝑥) = (𝐴 + (𝐶 + 𝑥))) |
| 8 | simprr 772 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → (𝐶 + 𝑥) = 0) | |
| 9 | 8 | oveq2d 7357 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → (𝐴 + (𝐶 + 𝑥)) = (𝐴 + 0)) |
| 10 | addrid 11285 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴) | |
| 11 | 4, 10 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → (𝐴 + 0) = 𝐴) |
| 12 | 7, 9, 11 | 3eqtrd 2769 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → ((𝐴 + 𝐶) + 𝑥) = 𝐴) |
| 13 | simpl2 1193 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → 𝐵 ∈ ℂ) | |
| 14 | 13, 5, 6 | addassd 11126 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → ((𝐵 + 𝐶) + 𝑥) = (𝐵 + (𝐶 + 𝑥))) |
| 15 | 8 | oveq2d 7357 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → (𝐵 + (𝐶 + 𝑥)) = (𝐵 + 0)) |
| 16 | addrid 11285 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (𝐵 + 0) = 𝐵) | |
| 17 | 13, 16 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → (𝐵 + 0) = 𝐵) |
| 18 | 14, 15, 17 | 3eqtrd 2769 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → ((𝐵 + 𝐶) + 𝑥) = 𝐵) |
| 19 | 12, 18 | eqeq12d 2746 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → (((𝐴 + 𝐶) + 𝑥) = ((𝐵 + 𝐶) + 𝑥) ↔ 𝐴 = 𝐵)) |
| 20 | 3, 19 | imbitrid 244 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → ((𝐴 + 𝐶) = (𝐵 + 𝐶) → 𝐴 = 𝐵)) |
| 21 | oveq1 7348 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 + 𝐶) = (𝐵 + 𝐶)) | |
| 22 | 20, 21 | impbid1 225 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝐶 + 𝑥) = 0)) → ((𝐴 + 𝐶) = (𝐵 + 𝐶) ↔ 𝐴 = 𝐵)) |
| 23 | 2, 22 | rexlimddv 3137 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐶) = (𝐵 + 𝐶) ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2110 ∃wrex 3054 (class class class)co 7341 ℂcc 10996 0cc0 10998 + caddc 11001 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-addrcl 11059 ax-mulcl 11060 ax-mulrcl 11061 ax-mulcom 11062 ax-addass 11063 ax-mulass 11064 ax-distr 11065 ax-i2m1 11066 ax-1ne0 11067 ax-1rid 11068 ax-rnegex 11069 ax-rrecex 11070 ax-cnre 11071 ax-pre-lttri 11072 ax-pre-lttrn 11073 ax-pre-ltadd 11074 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-po 5522 df-so 5523 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-ov 7344 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-pnf 11140 df-mnf 11141 df-ltxr 11143 |
| This theorem is referenced by: addcom 11291 addcan2i 11299 addcomd 11307 addcan2d 11309 muleqadd 11753 axlowdimlem14 28926 subfacp1lem6 35197 fargshiftf1 47451 |
| Copyright terms: Public domain | W3C validator |