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

Theorem eqneg 9028
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 8426 . . 3  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  A )  =  ( A  +  A ) )
2 ax-1cn 8238 . . . . . 6  |-  1  e.  CC
32, 2addcli 8296 . . . . 5  |-  ( 1  +  1 )  e.  CC
43mul01i 8684 . . . 4  |-  ( ( 1  +  1 )  x.  0 )  =  0
5 negid 8539 . . . 4  |-  ( A  e.  CC  ->  ( A  +  -u A )  =  0 )
64, 5eqtr4id 2286 . . 3  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  0 )  =  ( A  +  -u A ) )
71, 6eqeq12d 2249 . 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 8285 . . 3  |-  ( A  e.  CC  ->  0  e.  CC )
103a1i 9 . . 3  |-  ( A  e.  CC  ->  (
1  +  1 )  e.  CC )
11 1re 8291 . . . . . 6  |-  1  e.  RR
1211, 11readdcli 8305 . . . . 5  |-  ( 1  +  1 )  e.  RR
13 0lt1 8419 . . . . . 6  |-  0  <  1
1411, 11, 13, 13addgt0ii 8785 . . . . 5  |-  0  <  ( 1  +  1 )
1512, 14gt0ap0ii 8922 . . . 4  |-  ( 1  +  1 ) #  0
1615a1i 9 . . 3  |-  ( A  e.  CC  ->  (
1  +  1 ) #  0 )
178, 9, 10, 16mulcanapd 8955 . 2  |-  ( A  e.  CC  ->  (
( ( 1  +  1 )  x.  A
)  =  ( ( 1  +  1 )  x.  0 )  <->  A  = 
0 ) )
18 negcl 8492 . . 3  |-  ( A  e.  CC  ->  -u A  e.  CC )
198, 8, 18addcand 8476 . 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 1398    e. wcel 2205   class class class wbr 4115  (class class class)co 6060   CCcc 8143   0cc0 8145   1c1 8146    + caddc 8148    x. cmul 8150   -ucneg 8464   # cap 8875
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4234  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4666  ax-cnex 8236  ax-resscn 8237  ax-1cn 8238  ax-1re 8239  ax-icn 8240  ax-addcl 8241  ax-addrcl 8242  ax-mulcl 8243  ax-mulrcl 8244  ax-addcom 8245  ax-mulcom 8246  ax-addass 8247  ax-mulass 8248  ax-distr 8249  ax-i2m1 8250  ax-0lt1 8251  ax-1rid 8252  ax-0id 8253  ax-rnegex 8254  ax-precex 8255  ax-cnre 8256  ax-pre-ltirr 8257  ax-pre-ltwlin 8258  ax-pre-lttrn 8259  ax-pre-apti 8260  ax-pre-ltadd 8261  ax-pre-mulgt0 8262  ax-pre-mulext 8263
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-br 4116  df-opab 4178  df-id 4420  df-po 4423  df-iso 4424  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-iota 5319  df-fun 5361  df-fv 5367  df-riota 6013  df-ov 6063  df-oprab 6064  df-mpo 6065  df-pnf 8328  df-mnf 8329  df-xr 8330  df-ltxr 8331  df-le 8332  df-sub 8465  df-neg 8466  df-reap 8869  df-ap 8876
This theorem is referenced by:  eqnegd  9029  eqnegi  9037
  Copyright terms: Public domain W3C validator