[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 comp-same
i2 < i1, i + i4 * (i1 - i2) < i3, 0 ≤ i2, 0 ≤ i4, 0 ≤ j0, j0 ≤ i4, 0 ≤ i, ∀ j. 0 ≤ j ∧ j < i3 → st[r -- (i1 + j) '] = st[r -- (i2 + j) '] ⊦ st[r -- (i1 + i + j0 * (i1 - i2)) '] = st[r -- (i1 + i) ']
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: 8
Proof steps: 14
Used lemmas:
Used spec theorems:
int-mult
/
dist-lsplit
Used simplifier rules:
int-mult
/
one
int-abs
/
sub-add-01
int-mult
/
add-mult-two
int-abs
/
Sub-def
int-abs
/
zero-gels-04
int-abs
/
mone-06
int-abs
/
numle-02
int-abs
/
succ-01
int-abs
/
elim-sub
int-basic2
/
add-in
int-abs
/
forward-le-02
oelem
/intlista/
transitivity
int-abs
/
zero-gels-01
int-mult
/
zero-ls-02
int-abs
/
sub-ls
int-basic1
/
ls-01
int-basic2
/
ls-01
int-mult
/
ls-sub
int-basic2
/
zero-02
int-abs
/
forward-le-05
int-abs
/
forward-le
int-abs
/
lels-02
int-basic2
/
ls
int-abs
/
forward-lsle
int-abs
/
sub-le
int-abs
/
leone
int-abs
/
sub-le-01
int-abs
/
lels-04
int-abs
/
lels-03
int-basic2
/
add-c
intnat
/
abs-pred
int-abs
/
anti
oelem
/intlista/
lel
int-mult
/
Mult-zero
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
ax-04
int-basic2
/
add-a
int-abs
/
forward-lels
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
lels-01