[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 95 from proof decode-node (
previous step
)
⊦ n = # buf ∧ m ≤ # buf0 → subarray(buf + buf0, n, m) = subarray(buf0, 0, m)
A spec-lemma