[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 2 from proof fromnext-reachable (
previous step
)
reachable(r, r0, H) ⊦ reachable(H[r].nxt, r0, H) ↔ true, r = r0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
reachable(r, r0, H) ⊦ r = r0, reachable(H[r].nxt, r0, H)
Rule argument
Additional information