| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > negeq | GIF version | ||
| Description: Equality theorem for negatives. (Contributed by NM, 10-Feb-1995.) |
| Ref | Expression |
|---|---|
| negeq | ⊢ (𝐴 = 𝐵 → -𝐴 = -𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 6036 | . 2 ⊢ (𝐴 = 𝐵 → (0 − 𝐴) = (0 − 𝐵)) | |
| 2 | df-neg 8395 | . 2 ⊢ -𝐴 = (0 − 𝐴) | |
| 3 | df-neg 8395 | . 2 ⊢ -𝐵 = (0 − 𝐵) | |
| 4 | 1, 2, 3 | 3eqtr4g 2289 | 1 ⊢ (𝐴 = 𝐵 → -𝐴 = -𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 (class class class)co 6028 0cc0 8075 − cmin 8392 -cneg 8393 |
| 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 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-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-rex 2517 df-v 2805 df-un 3205 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-iota 5293 df-fv 5341 df-ov 6031 df-neg 8395 |
| This theorem is referenced by: negeqi 8415 negeqd 8416 neg11 8472 negf1o 8603 recexre 8800 negiso 9177 elz 9525 znegcl 9554 zaddcllemneg 9562 elz2 9595 zindd 9642 infrenegsupex 9872 supinfneg 9873 infsupneg 9874 supminfex 9875 ublbneg 9891 eqreznegel 9892 negm 9893 qnegcl 9914 xnegeq 10106 infssuzex 10539 infssuzcldc 10541 zsupssdc 10544 ceilqval 10614 exp3val 10849 expnegap0 10855 m1expcl2 10869 negfi 11851 dvdsnegb 12432 lcmneg 12709 pcexp 12945 pcneg 12961 znnen 13082 mulgneg2 13806 negcncf 15399 negfcncf 15400 lgsdir2lem4 15833 ex-ceil 16423 |
| Copyright terms: Public domain | W3C validator |