[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 2 from proof datasize-add-empty-h (
previous step
)
subarray(buf, n0, n1) = mkempbuf(n1), n0 + n1 ≤ # buf ⊦ datasize(buf, n0 + n1) = datasize(buf, n0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
subarray(buf, n0, n1) = mkempbuf(n1), n0 + n1 ≤ # buf ⊦ datasize(buf, n0 + n1) = datasize(buf, n0)
Rule argument
Additional information