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