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