[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 changenonnxt-reachable (
previous step
)
ce.nxt = H[r1].nxt, path(H[r].nxt ' + x0, H), r ∈ H, r ∈ H[r1, ce], ∀ ce, H, r1, r. ce.nxt = H[r1].nxt ∧ path(r ' + x0, H) → path(r ' + x0, H[r1, ce]) ⊦ r = r1, r = null, path(H[r].nxt ' + x0, H[r1, ce])
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 5 terms: ce, H, r1, H[r].nxt
Additional information
Used terms: ce, H, r1, H[r].nxt