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

Theorem negeq 8350
Description: Equality theorem for negatives. (Contributed by NM, 10-Feb-1995.)
Assertion
Ref Expression
negeq  |-  ( A  =  B  ->  -u A  =  -u B )

Proof of Theorem negeq
StepHypRef Expression
1 oveq2 6015 . 2  |-  ( A  =  B  ->  (
0  -  A )  =  ( 0  -  B ) )
2 df-neg 8331 . 2  |-  -u A  =  ( 0  -  A )
3 df-neg 8331 . 2  |-  -u B  =  ( 0  -  B )
41, 2, 33eqtr4g 2287 1  |-  ( A  =  B  ->  -u A  =  -u B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395  (class class class)co 6007   0cc0 8010    - cmin 8328   -ucneg 8329
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-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-ext 2211
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rex 2514  df-v 2801  df-un 3201  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-iota 5278  df-fv 5326  df-ov 6010  df-neg 8331
This theorem is referenced by:  negeqi  8351  negeqd  8352  neg11  8408  negf1o  8539  recexre  8736  negiso  9113  elz  9459  znegcl  9488  zaddcllemneg  9496  elz2  9529  zindd  9576  infrenegsupex  9801  supinfneg  9802  infsupneg  9803  supminfex  9804  ublbneg  9820  eqreznegel  9821  negm  9822  qnegcl  9843  xnegeq  10035  infssuzex  10465  infssuzcldc  10467  zsupssdc  10470  ceilqval  10540  exp3val  10775  expnegap0  10781  m1expcl2  10795  negfi  11755  dvdsnegb  12335  lcmneg  12612  pcexp  12848  pcneg  12864  znnen  12985  mulgneg2  13709  negcncf  15295  negfcncf  15296  lgsdir2lem4  15726  ex-ceil  16173
  Copyright terms: Public domain W3C validator