ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eqneg Unicode version

Theorem eqneg 8890
Description: A number equal to its negative is zero. (Contributed by NM, 12-Jul-2005.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
eqneg  |-  ( A  e.  CC  ->  ( A  =  -u A  <->  A  = 
0 ) )

Proof of Theorem eqneg
StepHypRef Expression
1 1p1times 8291 . . 3  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  A )  =  ( A  +  A ) )
2 ax-1cn 8103 . . . . . 6  |-  1  e.  CC
32, 2addcli 8161 . . . . 5  |-  ( 1  +  1 )  e.  CC
43mul01i 8548 . . . 4  |-  ( ( 1  +  1 )  x.  0 )  =  0
5 negid 8404 . . . 4  |-  ( A  e.  CC  ->  ( A  +  -u A )  =  0 )
64, 5eqtr4id 2281 . . 3  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  0 )  =  ( A  +  -u A ) )
71, 6eqeq12d 2244 . 2  |-  ( A  e.  CC  ->  (
( ( 1  +  1 )  x.  A
)  =  ( ( 1  +  1 )  x.  0 )  <->  ( A  +  A )  =  ( A  +  -u A
) ) )
8 id 19 . . 3  |-  ( A  e.  CC  ->  A  e.  CC )
9 0cnd 8150 . . 3  |-  ( A  e.  CC  ->  0  e.  CC )
103a1i 9 . . 3  |-  ( A  e.  CC  ->  (
1  +  1 )  e.  CC )
11 1re 8156 . . . . . 6  |-  1  e.  RR
1211, 11readdcli 8170 . . . . 5  |-  ( 1  +  1 )  e.  RR
13 0lt1 8284 . . . . . 6  |-  0  <  1
1411, 11, 13, 13addgt0ii 8649 . . . . 5  |-  0  <  ( 1  +  1 )
1512, 14gt0ap0ii 8786 . . . 4  |-  ( 1  +  1 ) #  0
1615a1i 9 . . 3  |-  ( A  e.  CC  ->  (
1  +  1 ) #  0 )
178, 9, 10, 16mulcanapd 8819 . 2  |-  ( A  e.  CC  ->  (
( ( 1  +  1 )  x.  A
)  =  ( ( 1  +  1 )  x.  0 )  <->  A  = 
0 ) )
18 negcl 8357 . . 3  |-  ( A  e.  CC  ->  -u A  e.  CC )
198, 8, 18addcand 8341 . 2  |-  ( A  e.  CC  ->  (
( A  +  A
)  =  ( A  +  -u A )  <->  A  =  -u A ) )
207, 17, 193bitr3rd 219 1  |-  ( A  e.  CC  ->  ( A  =  -u A  <->  A  = 
0 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1395    e. wcel 2200   class class class wbr 4083  (class class class)co 6007   CCcc 8008   0cc0 8010   1c1 8011    + caddc 8013    x. cmul 8015   -ucneg 8329   # cap 8739
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740
This theorem is referenced by:  eqnegd  8891  eqnegi  8899
  Copyright terms: Public domain W3C validator