[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-in-upper
⊦ i0 + j ≤ j0 → (r0 -- j0 ' ∈ arraycopy(r, i, r0, i0, j, st) ↔ r0 -- j0 ' ∈ st)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
copy-in-between
,
copy-in-upper-01
,
copy-succ
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 4
Used lemmas:
arrayCopy-base
,
arrayCopy-rec
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-03
intnat
/
abs-pred
int-abs
/
sub-add-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-le
int-abs
/
lels-01
int-abs
/
succ-02
int-basic1
/
lst-01
int-abs
/
sub-eq
storekey
/
inj-04
javastore
/
instore-02
int-abs
/
forward-le-05
int-abs
/
forward-lsle
int-basic2
/
ls
int-abs
/
lels