[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-add-butlast
⊦ i = n→i(# vals) + 1 → putArray(vals, r, 0, addarray(r, ty, i, st)) = addarray(r, ty, vals + initial_value(ty), st)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 16
Used lemmas:
init-switch
,
addarrayinit-def
,
putarray-add-same-02
,
addarray-rec
,
addarray-def
,
add-lastrec
,
Used spec theorems:
storearrays
/
putar-rew
store
/javastore/
rew
Used simplifier rules:
refkey
/
inj-01
store
/javastore/
insins
refkey
/
inj
specialkeys
/
len
specialkeys
/
length-04
nat
/
ler
refkey
/
sel-01
refkey
/
sel-02
storekey
/
test-06
storekey
/
sel-06
intnat
/
nat2int-08
intnat
/
le
nat
/
lels-01
nat-basic1
/
ref-1
int-basic2
/
ax-04
int-abs
/
numsub
int-abs
/
ax-02
int-abs
/
numls-02
int-abs
/
mone-06
intnat
/
nat2int
int-basic2
/
add-a
int-basic2
/
add-c
list
/javavalues/
e-02
intnat
/
n2i-add
list-last
/javavalues/
last-def
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
pred
list
/javavalues/
len-02
list
/javavalues/
len
list-last
/javavalues/
butlast-def
list
/javavalues/
Last
list
/javavalues/
app-02-ant
list
/javavalues/
e
list
/javavalues/
a