[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-lastrec
⊦ putArray(vals + val ', r, i, st) = putArray(vals, r, i, st[r -- (i + n→i(# vals)) ', val])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
putArray-put
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 20
Used lemmas:
putArray-rec
,
putArray-empty
,
putar-rew
,
Used spec theorems:
list
/javavalues/
One
list
/javavalues/
c
list
/javavalues/
Noassoc
store
/javastore/
rew
int-basic2
/
add-a
Used simplifier rules:
int-abs
/
ler
int-abs
/
succ-02
int-abs
/
lels-01
oelem
/intlista/
irreflexivity
refkey
/
inj-01
list
/javavalues/
len
list
/javavalues/
len-02
intnat
/
n2i-add
nat-basic2
/
a
nat-basic2
/
c
refkey
/
inj
storekey
/
inj-04
int-basic2
/
eq
intnat
/
nat2int-07
int-basic2
/
ax-04
list-data
/javavalues/
size-01
list
/javavalues/
a
list
/javavalues/
Nil
nat
/
ler
refkey
/
sel-01
refkey
/
sel-02
storekey
/
test-06
storekey
/
sel-06
int-basic2
/
ls
intnat
/
nat2int-08
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
le-add
intnat
/
le
nat
/
lels-01
nat-basic1
/
ref-1