| 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 6026 | . 2 ⊢ (𝐴 = 𝐵 → (0 − 𝐴) = (0 − 𝐵)) | |
| 2 | df-neg 8353 | . 2 ⊢ -𝐴 = (0 − 𝐴) | |
| 3 | df-neg 8353 | . 2 ⊢ -𝐵 = (0 − 𝐵) | |
| 4 | 1, 2, 3 | 3eqtr4g 2289 | 1 ⊢ (𝐴 = 𝐵 → -𝐴 = -𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 (class class class)co 6018 0cc0 8032 − cmin 8350 -cneg 8351 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-rex 2516 df-v 2804 df-un 3204 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-iota 5286 df-fv 5334 df-ov 6021 df-neg 8353 |
| This theorem is referenced by: negeqi 8373 negeqd 8374 neg11 8430 negf1o 8561 recexre 8758 negiso 9135 elz 9481 znegcl 9510 zaddcllemneg 9518 elz2 9551 zindd 9598 infrenegsupex 9828 supinfneg 9829 infsupneg 9830 supminfex 9831 ublbneg 9847 eqreznegel 9848 negm 9849 qnegcl 9870 xnegeq 10062 infssuzex 10494 infssuzcldc 10496 zsupssdc 10499 ceilqval 10569 exp3val 10804 expnegap0 10810 m1expcl2 10824 negfi 11793 dvdsnegb 12374 lcmneg 12651 pcexp 12887 pcneg 12903 znnen 13024 mulgneg2 13748 negcncf 15335 negfcncf 15336 lgsdir2lem4 15766 ex-ceil 16344 |
| Copyright terms: Public domain | W3C validator |