| 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 11302 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 0 ∈ ℂ) | |
| 2 | simpr 490 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | simpl 488 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 4 | 1, 2, 3 | subadd2d 11691 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((0 − 𝐵) = 𝐴 ↔ (𝐴 + 𝐵) = 0)) |
| 5 | df-neg 11547 | . . . 4 ⊢ -𝐵 = (0 − 𝐵) | |
| 6 | 5 | eqeq1i 2765 | . . 3 ⊢ ( -𝐵 = 𝐴 ↔ (0 − 𝐵) = 𝐴) |
| 7 | eqcom 2767 | . . 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 1569 ∈ wcel 2144 (class class class)co 7420 ℂcc 11201 0cc0 11203 + caddc 11206 − cmin 11544 -cneg 11545 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11348 df-mnf 11349 df-ltxr 11351 df-sub 11546 df-neg 11547 |
| This theorem is used by: constrrtcclem 34412 constrsqrtcl 34457 cos9thpiminplylem4 34463 cos9thpiminplylem5 34464 cos9thpinconstrlem1 34467 ballotlemfrceq 35207 sqrtcval 44734 goldratmolem3 48027 rrx2linest 49947 itsclquadb 49981 |
| Copyright terms: Public domain | W3C validator |