[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 8 from proof prepost-split-nodes (
previous step
)
jmaxino0 = ndx.flashsize + jmaxino, jmaxino0 = n, ndx0 = [], ndx0 = ndx5, ndx1 = ndx3, ndx4 = ndx2, ndx6 = [], ndx7 = ndx + ndx0, ndx7 = ndx3, ndx0.head.flashsize ≤ jmaxino, ndx0 ≠ [] → ndx0 ≠ [] ⊦ ndx0 = []
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information