[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 copy-between
⊦ r ≠ r0 ∧ i0 ≤ j0 ∧ j0 < i0 + j → (arraycopy(r, i, r0, i0, j, st)[r0 -- j0 ']) = st[r -- ((j0 - i0) + i) ']
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
comp-copy
,
copy-at-01
,
copy-lower
,
copy-succ
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 8
Used lemmas:
copy-upper
,
arrayCopy-rec
,
Used spec theorems:
int-abs
/
numadd-01
Used simplifier rules:
int-abs
/
sub-add-04
int-abs
/
ler
int-abs
/
sub-eq
storekey
/
inj-04
refkey
/
inj-01
javastore
/
lookup-if
int-abs
/
lels
intnat
/
abs-pred
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
sub-ls-01
oelem
/intlista/
sls
int-abs
/
succ-02
int-abs
/
lels-03
javastore
/
look-ins
int-abs
/
les
int-abs
/
sub-le
int-abs
/
forward-le-05
int-basic2
/
ls-02
int-abs
/
forward-lels
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
sub-add-01