Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > negeqd | Unicode version |
Description: Equality deduction for negatives. (Contributed by NM, 14-May-1999.) |
Ref | Expression |
---|---|
negeqd.1 |
Ref | Expression |
---|---|
negeqd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | negeqd.1 | . 2 | |
2 | negeq 7948 | . 2 | |
3 | 1, 2 | syl 14 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wceq 1331 cneg 7927 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-rex 2420 df-v 2683 df-un 3070 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-br 3925 df-iota 5083 df-fv 5126 df-ov 5770 df-neg 7929 |
This theorem is referenced by: negdi 8012 mulneg2 8151 mulm1 8155 eqord2 8239 mulreim 8359 apneg 8366 divnegap 8459 div2negap 8488 recgt0 8601 infrenegsupex 9382 supminfex 9385 mul2lt0rlt0 9539 ceilqval 10072 ceilid 10081 modqcyc2 10126 monoord2 10243 reneg 10633 imneg 10641 cjcj 10648 cjneg 10655 minmax 10994 minabs 11000 telfsumo2 11229 sinneg 11422 tannegap 11424 sincossq 11444 odd2np1 11559 oexpneg 11563 modgcd 11668 ivthdec 12780 limcimolemlt 12791 dvrecap 12835 sinperlem 12878 efimpi 12889 ptolemy 12894 ex-ceil 12927 |
Copyright terms: Public domain | W3C validator |