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

Theorem negeq 7948
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 5775 . 2  |-  ( A  =  B  ->  (
0  -  A )  =  ( 0  -  B ) )
2 df-neg 7929 . 2  |-  -u A  =  ( 0  -  A )
3 df-neg 7929 . 2  |-  -u B  =  ( 0  -  B )
41, 2, 33eqtr4g 2195 1  |-  ( A  =  B  ->  -u A  =  -u B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1331  (class class class)co 5767   0cc0 7613    - cmin 7926   -ucneg 7927
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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-rex 2420  df-v 2683  df-un 3070  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-iota 5083  df-fv 5126  df-ov 5770  df-neg 7929
This theorem is referenced by:  negeqi  7949  negeqd  7950  neg11  8006  negf1o  8137  recexre  8333  negiso  8706  elz  9049  znegcl  9078  zaddcllemneg  9086  elz2  9115  zindd  9162  infrenegsupex  9382  supinfneg  9383  infsupneg  9384  supminfex  9385  ublbneg  9398  eqreznegel  9399  negm  9400  qnegcl  9421  xnegeq  9603  ceilqval  10072  exp3val  10288  expnegap0  10294  m1expcl2  10308  negfi  10992  dvdsnegb  11499  infssuzex  11631  infssuzcldc  11633  lcmneg  11744  znnen  11900  negcncf  12746  negfcncf  12747  ex-ceil  12927
  Copyright terms: Public domain W3C validator