[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 rem-reachable
⊦ reachable(r, r0, H) ∧ ce.nxt = H[H[r1].nxt].nxt ∧ r0 ≠ H[r1].nxt ∧ H[r1].nxt ∈ H ∧ H[r1].nxt ≠ null ∧ r1 ≠ null ∧ r1 ∈ H → (¬ reachable(r, r0, H[r1, ce]) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
rem-reachable-rev
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 15
Used lemmas:
fromnext-reachable
,
reachable-notnullinH
,
fromnext-reachable-rev
,
path-last
,
path-cons
,
self-reachable
,
path-one
,
reachable-def
,
reach-alloc
,
Used spec theorems:
store
/linheap/
At-other
Used simplifier rules:
list
/reflist/
app
list-last
/reflist/
l
list-last
/reflist/
l-05
list
/reflist/
a
list
/reflist/
c
store
/linheap/
In-insert
store
/linheap/
At-same
store
/linheap/
insin
store
/linheap/
k-At-same