[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 56 from proof refine-read-buf (
previous step
)
⊦ n0 + m ≤ # buf ∧ n1 + m ≤ # buf0 → copy(buf, n0, buf0, n1, m) = subarray(buf0, 0, n1) + subarray(buf, n0, m) + subarray(buf0, n1 + m, # buf0 - n1 - m)
A spec-lemma