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

Theorem negeq 8509
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 6083 . 2  |-  ( A  =  B  ->  (
0  -  A )  =  ( 0  -  B ) )
2 df-neg 8490 . 2  |-  -u A  =  ( 0  -  A )
3 df-neg 8490 . 2  |-  -u B  =  ( 0  -  B )
41, 2, 33eqtr4g 2296 1  |-  ( A  =  B  ->  -u A  =  -u B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402  (class class class)co 6075   0cc0 8169    - cmin 8487   -ucneg 8488
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-iota 5332  df-fv 5380  df-ov 6078  df-neg 8490
This theorem is referenced by:  negeqi  8510  negeqd  8511  neg11  8567  negf1o  8699  recexre  8896  negiso  9275  elz  9625  znegcl  9654  zaddcllemneg  9662  elz2  9695  zindd  9743  infrenegsupex  9973  supinfneg  9974  infsupneg  9975  supminfex  9976  ublbneg  9992  eqreznegel  9993  negm  9994  qnegcl  10015  xnegeq  10208  infssuzex  10644  infssuzcldc  10646  zsupssdc  10651  ceilqval  10721  exp3val  10956  expnegap0  10962  m1expcl2  10976  negfi  11972  dvdsnegb  12553  lcmneg  12830  pcexp  13066  pcneg  13082  znnen  13267  mulgneg2  13936  negcncf  15629  negfcncf  15630  lgsdir2lem4  16064  ex-ceil  16654
  Copyright terms: Public domain W3C validator