[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 modlsp-02
j * i + j0 < j * i0, abs(j0) < j ⊦ i ≤ i0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
le-two
,
ls-add
,
modlsp-03
,
modlsp-04
,
mods-ls-04
,
modzero
,
Used by units in proved state:
int-pot
,
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
modlsp-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-01
int-abs
/
neg-15
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-ls-01
int-abs
/
abs-neg