[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-not
⊦ abs(i) < j ∧ j ≤ abs(i0) → i + i0 ≠ 0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 6
Used lemmas:
zero-gels-01
,
numls-03
,
sub-ls-01
,
rew-eqzero
,
numlsf-01
,
Abs-pos
,
abs-16
,
forward-le-02
,
forward-le-05
,
sub-ls
,
Minus-def
,
abs-08
,
le-def
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
ls-01
int-basic2
/
neq-01
int-basic2
/
zero-06
int-basic2
/
lst-04
int-basic2
/
succ-01
int-basic1
/
forward-pos
int-basic1
/
ls-01
int-basic2
/
ls-02
int-basic1
/
lf-08
int-basic1
/
lf-02
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
add-zero-rev
int-basic2
/
zero-01
int-basic1
/
lf-01
int-basic1
/
trans
int-basic1
/
numlsf