Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > eqneg | GIF version |
Description: A number equal to its negative is zero. (Contributed by NM, 12-Jul-2005.) (Revised by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
eqneg | ⊢ (𝐴 ∈ ℂ → (𝐴 = -𝐴 ↔ 𝐴 = 0)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1p1times 7896 | . . 3 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) | |
2 | negid 8009 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐴 + -𝐴) = 0) | |
3 | ax-1cn 7713 | . . . . . 6 ⊢ 1 ∈ ℂ | |
4 | 3, 3 | addcli 7770 | . . . . 5 ⊢ (1 + 1) ∈ ℂ |
5 | 4 | mul01i 8153 | . . . 4 ⊢ ((1 + 1) · 0) = 0 |
6 | 2, 5 | syl6reqr 2191 | . . 3 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 0) = (𝐴 + -𝐴)) |
7 | 1, 6 | eqeq12d 2154 | . 2 ⊢ (𝐴 ∈ ℂ → (((1 + 1) · 𝐴) = ((1 + 1) · 0) ↔ (𝐴 + 𝐴) = (𝐴 + -𝐴))) |
8 | id 19 | . . 3 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ ℂ) | |
9 | 0cnd 7759 | . . 3 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℂ) | |
10 | 4 | a1i 9 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 + 1) ∈ ℂ) |
11 | 1re 7765 | . . . . . 6 ⊢ 1 ∈ ℝ | |
12 | 11, 11 | readdcli 7779 | . . . . 5 ⊢ (1 + 1) ∈ ℝ |
13 | 0lt1 7889 | . . . . . 6 ⊢ 0 < 1 | |
14 | 11, 11, 13, 13 | addgt0ii 8253 | . . . . 5 ⊢ 0 < (1 + 1) |
15 | 12, 14 | gt0ap0ii 8390 | . . . 4 ⊢ (1 + 1) # 0 |
16 | 15 | a1i 9 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 + 1) # 0) |
17 | 8, 9, 10, 16 | mulcanapd 8422 | . 2 ⊢ (𝐴 ∈ ℂ → (((1 + 1) · 𝐴) = ((1 + 1) · 0) ↔ 𝐴 = 0)) |
18 | negcl 7962 | . . 3 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
19 | 8, 8, 18 | addcand 7946 | . 2 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 𝐴) = (𝐴 + -𝐴) ↔ 𝐴 = -𝐴)) |
20 | 7, 17, 19 | 3bitr3rd 218 | 1 ⊢ (𝐴 ∈ ℂ → (𝐴 = -𝐴 ↔ 𝐴 = 0)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1331 ∈ wcel 1480 class class class wbr 3929 (class class class)co 5774 ℂcc 7618 0cc0 7620 1c1 7621 + caddc 7623 · cmul 7625 -cneg 7934 # cap 8343 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-mulrcl 7719 ax-addcom 7720 ax-mulcom 7721 ax-addass 7722 ax-mulass 7723 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-1rid 7727 ax-0id 7728 ax-rnegex 7729 ax-precex 7730 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 ax-pre-mulgt0 7737 ax-pre-mulext 7738 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-id 4215 df-po 4218 df-iso 4219 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-reap 8337 df-ap 8344 |
This theorem is referenced by: eqnegd 8493 eqnegi 8501 |
Copyright terms: Public domain | W3C validator |