Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > negeq | Unicode version |
Description: Equality theorem for negatives. (Contributed by NM, 10-Feb-1995.) |
Ref | Expression |
---|---|
negeq |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq2 5844 | . 2 | |
2 | df-neg 8063 | . 2 | |
3 | df-neg 8063 | . 2 | |
4 | 1, 2, 3 | 3eqtr4g 2222 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wceq 1342 (class class class)co 5836 cc0 7744 cmin 8060 cneg 8061 |
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 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-rex 2448 df-v 2723 df-un 3115 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-br 3977 df-iota 5147 df-fv 5190 df-ov 5839 df-neg 8063 |
This theorem is referenced by: negeqi 8083 negeqd 8084 neg11 8140 negf1o 8271 recexre 8467 negiso 8841 elz 9184 znegcl 9213 zaddcllemneg 9221 elz2 9253 zindd 9300 infrenegsupex 9523 supinfneg 9524 infsupneg 9525 supminfex 9526 ublbneg 9542 eqreznegel 9543 negm 9544 qnegcl 9565 xnegeq 9754 ceilqval 10231 exp3val 10447 expnegap0 10453 m1expcl2 10467 negfi 11155 dvdsnegb 11734 infssuzex 11867 infssuzcldc 11869 zsupssdc 11872 lcmneg 11985 pcexp 12218 pcneg 12233 znnen 12268 negcncf 13129 negfcncf 13130 ex-ceil 13444 |
Copyright terms: Public domain | W3C validator |