| 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 6058 | . 2 ⊢ (𝐴 = 𝐵 → (0 − 𝐴) = (0 − 𝐵)) | |
| 2 | df-neg 8447 | . 2 ⊢ -𝐴 = (0 − 𝐴) | |
| 3 | df-neg 8447 | . 2 ⊢ -𝐵 = (0 − 𝐵) | |
| 4 | 1, 2, 3 | 3eqtr4g 2290 | 1 ⊢ (𝐴 = 𝐵 → -𝐴 = -𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 (class class class)co 6050 0cc0 8127 − cmin 8444 -cneg 8445 |
| 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 2214 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-rex 2526 df-v 2815 df-un 3215 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-br 4110 df-iota 5312 df-fv 5360 df-ov 6053 df-neg 8447 |
| This theorem is referenced by: negeqi 8467 negeqd 8468 neg11 8524 negf1o 8655 recexre 8852 negiso 9229 elz 9579 znegcl 9608 zaddcllemneg 9616 elz2 9649 zindd 9696 infrenegsupex 9926 supinfneg 9927 infsupneg 9928 supminfex 9929 ublbneg 9945 eqreznegel 9946 negm 9947 qnegcl 9968 xnegeq 10160 infssuzex 10593 infssuzcldc 10595 zsupssdc 10598 ceilqval 10668 exp3val 10903 expnegap0 10909 m1expcl2 10923 negfi 11913 dvdsnegb 12494 lcmneg 12771 pcexp 13007 pcneg 13023 znnen 13149 mulgneg2 13873 negcncf 15470 negfcncf 15471 lgsdir2lem4 15904 ex-ceil 16494 |
| Copyright terms: Public domain | W3C validator |