[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 putArray-put
⊦ 0 ≤ j ∧ i = n→i(# vals) → (putArray(vals, r, j, st)[r -- (j + i) ', val]) = putArray(vals + val, r, j, st)
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: 10
Proof steps: 11
Used lemmas:
putArray-put-switch
,
putAr-lastrec
,
putArray-rec
,
putArray-one
,
putArray-empty
,
Used spec theorems:
list
/javavalues/
Cons
list
/javavalues/
c
list
/javavalues/
len-05
store
/javastore/
rew
Used simplifier rules:
refkey
/
inj
refkey
/
inj-01
storekey
/
inj-04
int-basic2
/
eq
intnat
/
nat2int-07
nat-basic2
/
succ
intnat
/
n2i-add
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
lels-01
int-abs
/
numle-02
int-abs
/
numleledel-01
int-abs
/
le-add
oelem
/intlista/
irreflexivity
int-basic1
/
numlsf
int-abs
/
forward-lsle
int-basic2
/
ls
intnat
/
nat2int-08
list-data
/javavalues/
size-01
int-basic2
/
ax-04
int-basic2
/
add-a
int-basic2
/
add-c
list
/javavalues/
Nil
list
/javavalues/
a
int-abs
/
forward-le-01
list
/javavalues/
Last