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 8032 | . . 3 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) | |
2 | ax-1cn 7846 | . . . . . 6 ⊢ 1 ∈ ℂ | |
3 | 2, 2 | addcli 7903 | . . . . 5 ⊢ (1 + 1) ∈ ℂ |
4 | 3 | mul01i 8289 | . . . 4 ⊢ ((1 + 1) · 0) = 0 |
5 | negid 8145 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐴 + -𝐴) = 0) | |
6 | 4, 5 | eqtr4id 2218 | . . 3 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 0) = (𝐴 + -𝐴)) |
7 | 1, 6 | eqeq12d 2180 | . 2 ⊢ (𝐴 ∈ ℂ → (((1 + 1) · 𝐴) = ((1 + 1) · 0) ↔ (𝐴 + 𝐴) = (𝐴 + -𝐴))) |
8 | id 19 | . . 3 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ ℂ) | |
9 | 0cnd 7892 | . . 3 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℂ) | |
10 | 3 | a1i 9 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 + 1) ∈ ℂ) |
11 | 1re 7898 | . . . . . 6 ⊢ 1 ∈ ℝ | |
12 | 11, 11 | readdcli 7912 | . . . . 5 ⊢ (1 + 1) ∈ ℝ |
13 | 0lt1 8025 | . . . . . 6 ⊢ 0 < 1 | |
14 | 11, 11, 13, 13 | addgt0ii 8389 | . . . . 5 ⊢ 0 < (1 + 1) |
15 | 12, 14 | gt0ap0ii 8526 | . . . 4 ⊢ (1 + 1) # 0 |
16 | 15 | a1i 9 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 + 1) # 0) |
17 | 8, 9, 10, 16 | mulcanapd 8558 | . 2 ⊢ (𝐴 ∈ ℂ → (((1 + 1) · 𝐴) = ((1 + 1) · 0) ↔ 𝐴 = 0)) |
18 | negcl 8098 | . . 3 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
19 | 8, 8, 18 | addcand 8082 | . 2 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 𝐴) = (𝐴 + -𝐴) ↔ 𝐴 = -𝐴)) |
20 | 7, 17, 19 | 3bitr3rd 218 | 1 ⊢ (𝐴 ∈ ℂ → (𝐴 = -𝐴 ↔ 𝐴 = 0)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1343 ∈ wcel 2136 class class class wbr 3982 (class class class)co 5842 ℂcc 7751 0cc0 7753 1c1 7754 + caddc 7756 · cmul 7758 -cneg 8070 # cap 8479 |
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 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-mulrcl 7852 ax-addcom 7853 ax-mulcom 7854 ax-addass 7855 ax-mulass 7856 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-1rid 7860 ax-0id 7861 ax-rnegex 7862 ax-precex 7863 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-apti 7868 ax-pre-ltadd 7869 ax-pre-mulgt0 7870 ax-pre-mulext 7871 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rab 2453 df-v 2728 df-sbc 2952 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-id 4271 df-po 4274 df-iso 4275 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-iota 5153 df-fun 5190 df-fv 5196 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-reap 8473 df-ap 8480 |
This theorem is referenced by: eqnegd 8629 eqnegi 8637 |
Copyright terms: Public domain | W3C validator |