[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 frommodified
⊦ r ≠ null ∧ ce.nxt ≠ r → (reachable(r, r0, h[r := ce]) ↔ r = r0 ∨ ce.nxt ≠ null ∧ ce.nxt ∈ h ∧ reachable(ce.nxt, r0, h[r := ce]))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 26
Used lemmas:
path-two
,
self-reachable
,
path-one
,
path-cons
,
reachable-def
,
Used spec theorems:
Used simplifier rules:
list
/
app
list
/
a
list-last
/
last-one
list-last
/
last-rec
list
/
c
store
/
At-same
store
/
insin
store
/
in-neq
store
/
At-other
list-last
/
last-def
list-last
/
l-02
list-last
/
lapp-02