[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 11 from proof removed-stays-reachable (
previous step
)
r0 ∈ H, H[r0].nxt ≠ null, H[r0].nxt ∈ H, H[r0].nxt ≠ H[H[r0].nxt].nxt ⊦ reachable(H[H[r0].nxt].nxt, H[r0].nxt, H) ∧ ¬ reachable(H[H[r0].nxt].nxt, r0, H) ↔ (∃ x. path(H[r0].nxt ' + x + H[r0].nxt ', H) ∧ ¬ r0 ∈ x)
Lemma
rem-stays-reachable-aux1