[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 mods-nls
⊦ 0 < i → ¬ i * abs(j) < j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
abs-ls-same-01
,
modzero-08
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
zero-gr
,
minus-left
,
associativity
,
zero-left
,
ls-same
,
commutativity
,
Used spec theorems:
int-abs
/
Abs-neg
Used simplifier rules:
int-abs
/
neg-06
int-abs
/
neg-13
int-abs
/
forward-le-05
int-basic1
/
lf-01
int-basic1
/
trans
int-abs
/
forward-le-02
int-basic2
/
succ-01
int-basic2
/
ls-01
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
ls-02
int-basic1
/
ls-01
int-abs
/
forward-le-01
int-abs
/
Abs-pos
int-basic2
/
num-between
int-abs
/
lels
int-abs
/
anti
int-basic1
/
lf-02