[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 4 from proof changenonnxt-reachable (
previous step
)
ce.nxt = H[r1].nxt, ∃ x. path(r ' + x, H) ∧ (r ' + x).last = r0, r0 ∈ H ⊦ reachable(r, r0, H[r1, ce])
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 5
:
ce.nxt = H[r1].nxt, path(r ' + x, H), (r ' + x).last ∈ H ⊦ reachable(r, (r ' + x).last, H[r1, ce])
Rule argument
Additional information