[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 1 from proof datsize-write-higher (conclusion)
⊦ m + n ≤ # buf ∧ n ≤ # buf0 ∧ ¬ m < datasize(buf) → ¬ datasize(copy(buf0, 0, buf, m, n)) < datasize(buf)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
datasize(copy(buf0, 0, buf, m, n)) < datasize(buf), m + n ≤ # buf, n ≤ # buf0 ⊦ m < datasize(buf)
Rule argument
Additional information