[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-append
⊦ putArray(vals + vals0, r, i, st) = putArray(vals, r, i, putArray(vals0, r, i + n→i(# vals), 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: 2
Proof steps: 3
Used lemmas:
putArray-rec
,
putArray-empty
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/javavalues/
len-02
list
/javavalues/
len
list
/javavalues/
c
list
/javavalues/
Nil
list
/javavalues/
a
list-data
/javavalues/
size-01
int-basic2
/
ax-04
int-basic2
/
add-a
int-basic2
/
add-c