[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-01
i * j + j0 = i0 * j + j1, j0 ≤ 0, abs(j0) < j, j1 ≤ 0, abs(j1) < j ⊦ i = i0 ∧ j0 = j1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
mod-neq
,
modeqp-03
,
Used by units in proved state:
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
modeqp
,
Used spec theorems:
int-abs
/
Abs-neg
Used simplifier rules:
int-abs
/
neg-12
int-basic2
/
add-in
int-abs
/
zero-gels-04
int-abs
/
negle-07
int-abs
/
sub-add-01
int-abs
/
sub-eq
int-abs
/
neg-15
int-abs
/
neg-06
int-abs
/
neg-13
int-abs
/
zero-gels-03
int-abs
/
lels
int-abs
/
forward-lels
int-abs
/
forward-le-04
int-abs
/
forward-le-05
int-basic1
/
lf-01
int-basic1
/
trans
int-abs
/
forward-le-02
int-basic2
/
ls-01
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
succ-01
int-basic2
/
ls-02
int-basic1
/
forward-pos
int-abs
/
numls-03
int-basic2
/
ls
int-abs
/
zero-gels-01
int-abs
/
abs-08
int-abs
/
lenls
int-abs
/
Abs-pos
int-abs
/
anti
int-basic2
/
add-zero-rev
int-abs
/
lels-02