[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
,
Proof step 10 from proof putByteArray-vals-addarray (
previous step
)
⊦ 0 ≤ j ∧ j ≤ i ∧ i ≤ j + n→i(# vals) → putArray(vals, r, j, addarray(r, val, i, st)) = addarray(r, mklist(val, i→n(j)) + vals, 0, st)
Lemma
putarray-addarray