[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 putAr-get-other
⊦ 0 ≤ i ∧ i→n(i) + # vals ≤ i→n(j) → (putArray(vals, r, i, st)[r -- j ']) = st[r -- j ']
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: 2
Proof steps: 8
Used lemmas:
putArray-rec
,
putArray-empty
,
Used spec theorems:
javastore
/
at-other-16
Used simplifier rules:
intnat
/
rax-04
int-basic2
/
add-a
int-basic2
/
add-c
nat-basic2
/
s
nat
/
lels
nat
/
ls-le-simp
int-abs
/
zero-gs
refkey
/
inj-01
refkey
/
inj
storekey
/
inj-04
store
/javastore/
At-same
int-abs
/
lels-02
nat-basic2
/
l-02
intnat
/
abs-zero
nat-basic1
/
f
int-abs
/
lels-01
nat
/
lels-01
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
list
/javavalues/
len-02
list
/javavalues/
len
list
/javavalues/
a
list
/javavalues/
c
int-abs
/
forward-le-01