[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 addarray-lastrec
⊦ vals ≠ [] → addarray(r, vals, i, st) = (addarray(r, vals .butlast, i, st)[r -- (i + n→i(# vals) - 1) ', vals .last])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
addarray-mklist-02
,
addarray-mklist-03
,
putarray-add-same-02
,
putarray-addarray
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
addarrayinit-rec
,
addarrayinit-base
,
one-init
,
Used spec theorems:
store
/javastore/
rew
Used simplifier rules:
refkey
/
inj
storekey
/
inj-04
int-basic2
/
eq
intnat
/
nat2int-07
list
/javavalues/
c
list
/javavalues/
Nil
list-data
/javavalues/
size-01
int-basic2
/
ax-04
list
/javavalues/
e-02
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-in
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/javavalues/
a
list
/javavalues/
len-02
list
/javavalues/
len
list-last
/javavalues/
last-elim
int-abs
/
elim-sub