[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 move-initvals
⊦ 0 ≤ i ∧ i→n(i) < # vals → (addarray(r, ty, vals, st)[r -- i ', val]) = addarray(r, ty, vals[i→n(i), val], st)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
move-initvals-01
,
move-initvals-02
,
move-initvals-03
,
putbytearray-addarray-override
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 23
Used lemmas:
add-lastrec
,
Used spec theorems:
store
/javastore/
rew
list-del
/javavalues/
put-last
list-del
/javavalues/
put-butlast
intnat
/
num-i2n-eq
Used simplifier rules:
nat-basic1
/
ref-1
int-abs
/
lels-01
int-abs
/
lels-04
nat
/
ls-le-simp
list-del
/javavalues/
put-length
nat
/
lels-03
list-del
/javavalues/
put-last
nat
/
anti
list
/javavalues/
e
list
/javavalues/
app-02-ant
int-basic2
/
add-c
list-last
/javavalues/
butlast-def
nat-basic2
/
pred
list-last
/javavalues/
last-def
intnat
/
nat2int
nat
/
ler
intnat
/
n2n
store
/javastore/
insins
storekey
/
inj-04
refkey
/
inj-01
refkey
/
inj
specialkeys
/
len
list
/javavalues/
e-02
nat-basic2
/
eq-01
list
/javavalues/
a
list
/javavalues/
len-02
list
/javavalues/
len
list-last
/javavalues/
last-elim
nat
/
le-ls-simp
nat
/
lels
nat-basic2
/
s
intnat
/
n2i-add
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic1
/
lf-01
nat
/
elim-pred-c
nat
/
pred-03
list-data
/javavalues/
l
int-abs
/
forward-le-01
nat-basic1
/
f