| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addeq0 | Structured version Visualization version GIF version | ||
| Description: Two complex numbers add up to zero iff they are each other's opposites. (Contributed by Thierry Arnoux, 2-May-2017.) |
| Ref | Expression |
|---|---|
| addeq0 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) = 0 ↔ 𝐴 = -𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0cnd 11326 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 0 ∈ ℂ) | |
| 2 | simpr 490 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | simpl 488 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 4 | 1, 2, 3 | subadd2d 11715 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((0 − 𝐵) = 𝐴 ↔ (𝐴 + 𝐵) = 0)) |
| 5 | df-neg 11571 | . . . 4 ⊢ -𝐵 = (0 − 𝐵) | |
| 6 | 5 | eqeq1i 2768 | . . 3 ⊢ ( -𝐵 = 𝐴 ↔ (0 − 𝐵) = 𝐴) |
| 7 | eqcom 2770 | . . 3 ⊢ ( -𝐵 = 𝐴 ↔ 𝐴 = -𝐵) | |
| 8 | 6, 7 | bitr3i 280 | . 2 ⊢ ((0 − 𝐵) = 𝐴 ↔ 𝐴 = -𝐵) |
| 9 | 4, 8 | bitr3di 289 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) = 0 ↔ 𝐴 = -𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 (class class class)co 7443 ℂcc 11225 0cc0 11227 + caddc 11230 − cmin 11568 -cneg 11569 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-pnf 11372 df-mnf 11373 df-ltxr 11375 df-sub 11570 df-neg 11571 |
| This theorem is used by: constrrtcclem 34436 constrsqrtcl 34481 cos9thpiminplylem4 34487 cos9thpiminplylem5 34488 cos9thpinconstrlem1 34491 ballotlemfrceq 35231 sqrtcval 44833 goldratmolem3 48139 rrx2linest 50059 itsclquadb 50093 |
| Copyright terms: Public domain | W3C validator |