[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 modzero-06
⊦ i < 0 ∧ j < j0 ∧ j < 0 → 0 < i * j + j0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp,
Comment:
Used by:
abs-ls
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
minus-one
,
commutativity
,
associativity
,
one
,
dist-rsplit
,
zero-ls-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-lele
int-abs
/
forward-lsle
int-abs
/
lep-02
int-basic1
/
ls-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels
int-abs
/
les
int-abs
/
neg-15
int-abs
/
sub-le
int-basic2
/
add-zero
int-abs
/
lels-03