[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 7 from proof self-reachable (
previous step
)
r ≠ null ∧ r ∈ H ⊦ ∃ x. path(r ' + x, H) ∧ (r ' + x).last = r
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 8
:
r ∈ H ⊦ r = null, ∃ x. path(r ' + x, H) ∧ (r ' + x).last = r
Rule argument
Additional information