![]() |
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 5790 | . 2 ⊢ (𝐴 = 𝐵 → (0 − 𝐴) = (0 − 𝐵)) | |
2 | df-neg 7960 | . 2 ⊢ -𝐴 = (0 − 𝐴) | |
3 | df-neg 7960 | . 2 ⊢ -𝐵 = (0 − 𝐵) | |
4 | 1, 2, 3 | 3eqtr4g 2198 | 1 ⊢ (𝐴 = 𝐵 → -𝐴 = -𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1332 (class class class)co 5782 0cc0 7644 − cmin 7957 -cneg 7958 |
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 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-rex 2423 df-v 2691 df-un 3080 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-iota 5096 df-fv 5139 df-ov 5785 df-neg 7960 |
This theorem is referenced by: negeqi 7980 negeqd 7981 neg11 8037 negf1o 8168 recexre 8364 negiso 8737 elz 9080 znegcl 9109 zaddcllemneg 9117 elz2 9146 zindd 9193 infrenegsupex 9416 supinfneg 9417 infsupneg 9418 supminfex 9419 ublbneg 9432 eqreznegel 9433 negm 9434 qnegcl 9455 xnegeq 9640 ceilqval 10110 exp3val 10326 expnegap0 10332 m1expcl2 10346 negfi 11031 dvdsnegb 11546 infssuzex 11678 infssuzcldc 11680 lcmneg 11791 znnen 11947 negcncf 12796 negfcncf 12797 ex-ceil 13109 |
Copyright terms: Public domain | W3C validator |