[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 id-reachable
⊦ H[r].nxt = null → (reachable(r, r0, H) ↔ ¬ ¬(r ∈ H ∧ r ≠ null ∧ r = r0))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
reachable-split-first
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
null-not-start-of-path
,
path-cons
,
reachable-def
,
null-not-reachable
,
reach-alloc
,
self-reachable
,
reachable-notnullinH
,
Used spec theorems:
Used simplifier rules:
list
/reflist/
c
list
/reflist/
a
list-last
/reflist/
l-05
list
/reflist/
app
list-last
/reflist/
l