[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 19 from proof reachable-split-last (
previous step
)
path(r ' + x1, H), H[(r ' + x1).last].nxt ∈ H ⊦ r = H[(r ' + x1).last].nxt, H[(r ' + x1).last].nxt = null, ∃ x. path(r ' + x, H) ∧ (r ' + x).last = (r ' + x1).last
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 3 terms: x1
Additional information
Used terms: x1