[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 modeqp-neg
i * i0 + j0 = i1 * j + j1, j0 < 0, abs(j0) < j, j1 < 0, abs(j1) < j, i < 0, 0 ≤ i0 ⊦ j < i0 ∨ i ≤ i1
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: 2
Used lemmas:
commutativity
,
associativity
,
minus-left
,
modneqp
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
lst-04
int-basic1
/
forward-pos
int-basic2
/
add-less
int-basic2
/
ls-add-both
int-abs
/
zero-gels-01
int-basic2
/
ls-02
int-basic2
/
ls-01
int-abs
/
numls-03
int-basic2
/
succ-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
lels-01
int-abs
/
lels
int-abs
/
abs-08
int-abs
/
neg-11
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
neg-12
int-abs
/
negle-07
int-basic2
/
add-zero-rev
int-abs
/
zero-gels-03
int-abs
/
neg-13
int-abs
/
neg-01