[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem one-neg
j ≠ 0 ⊦ 1 / j < 0 ↔ j = ~1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int-pot
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
div-elim1
,
div-elim
,
Used spec theorems:
int-abs
/
Abs-neg
int-mult
/
modeqp-copied
Used simplifier rules:
int-abs
/
lels-02
int-abs
/
absls-06
int-abs
/
absls-03
int-abs
/
abs-06
int-basic2
/
ls
int-basic2
/
zero-01
int-abs
/
neg-06
int-abs
/
mone-08
int-abs
/
numls-03
int-abs
/
neg-07
int-abs
/
sub-eq
int-basic2
/
add-zero
int-abs
/
neg-15
int-mult
/
minus-left
int-abs
/
mone-06
int-abs
/
leone
int-basic2
/
succ-01
int-abs
/
forward-lels
int-abs
/
numlef-01
int-abs
/
numlsf-02
int-abs
/
forward-lsle
int-basic1
/
trans
int-basic1
/
lf-01
int-mult
/
Mult-zero
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-01
int-abs
/
lels
int-abs
/
bet
int-mult
/
one-01
int-abs
/
forward-le-01
int-abs
/
forward-le-02
int-abs
/
lsone
int-abs
/
int-add-pos-01