[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 putByteArray-vals-addarray
⊦ 0 ≤ j ∧ j ≤ i ∧ i = n→i(# bytes) + j → putByteArray(bytes, r, j, addarray(r, byte_type, i, st)) = addarray(r, byte_type, mklist(initial_value(byte_type), i→n(j)) + mkjavavalues(bytes), 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: 10
Proof steps: 18
Used lemmas:
putarray-addarray
,
init-switch
,
addarrayinit-def
,
add-put-switch
,
addarray-def
,
Used spec theorems:
storearrays
/
putByteArray
storearrays
/
putArray-put-switch-02
Used simplifier rules:
int-abs
/
lels-01
int-abs
/
lels-04
int-basic2
/
ls
intnat
/
nat2int-08
int-abs
/
le-add
intnat
/
le
nat
/
lels-01
nat-basic1
/
ref-1
nat-basic2
/
c
nat-basic2
/
a
intnat
/
i2i-pos-01
intnat
/
n2i-add
list
/javavalues/
a
valuesfuns
/
mkjava-len
list-last
/javavalues/
mk-len
list
/javavalues/
len
specialkeys
/
type-06
specialkeys
/
length-04
int-abs
/
forward-le-01
int-basic2
/
add-c
int-basic2
/
add-a
intnat
/
nat2int
int-abs
/
lep