[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 zero-gr-add-02
⊦ 0 ≤ i0 ∧ i0 ≤ i1 ∧ j < 0 → ¬ 0 < i1 * j + i0
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
mod-nls
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 9
Used lemmas:
one
,
dist-lsplit
,
zero-gr-02
,
commutativity
,
associativity
,
Mult-zero
,
Used spec theorems:
Used simplifier rules:
int-abs
/
zero-gels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-abs
/
forward-le-02
int-abs
/
forward-le-05
int-abs
/
anti
int-basic2
/
add-zero
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-02
int-abs
/
le-add
int-abs
/
le-def
int-abs
/
lenls
int-abs
/
lels
int-abs
/
forward-lels
int-abs
/
forward-le-04
int-abs
/
forward-lele
int-basic2
/
ls-01
int-basic2
/
add-in
int-abs
/
numls-02
int-abs
/
mone-06
int-abs
/
lels-03