[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
,
Theorem reach-reachnext
⊦ reachable(r, r1, H) → (¬ reachable(r, H[r1].nxt, H) ↔ H[r1].nxt = null ∨ ¬ H[r1].nxt ∈ H)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
add-preserves-reachable-rev
,
linearity
,
reachable-addnew-rev
,
reachable-split-last
,
removed-stays-reachable
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 22
Used lemmas:
path-last
,
path-cons
,
path-two
,
path-one
,
reachable-def
,
reach-alloc
,
Used spec theorems:
Used simplifier rules:
list-last
/reflist/
last-01
list
/reflist/
Last
list
/reflist/
c
list
/reflist/
a
list-last
/reflist/
l-05
list
/reflist/
app
list-last
/reflist/
l