[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 17 from proof fill-stream-append (
previous step
)
m + n = # buf, n0 < m + n, n0 < n, n0 < # buf ⊦ fill(buf, zero, n, m)[n0] = buf[n0]
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 18
:
m + n = # buf, n0 < n, n0 < m + n ⊦ fill(buf, zero, n, m)[n0] = buf[n0]
Rule argument
Additional information