[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 k-reachable-def
⊦ reachable(r, r0, H) ↔ r ≠ null ∧ r ∈ H ∧ reachable*(H, r, r0)
Type: A user defined theorem
Validity: The proof is valid.
Features: kodkodax,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 36
Used lemmas:
path-two
,
reachable-n-rec
,
reachable-1-def
,
reachable-n-1
,
path-cons
,
reachable-n-base
,
path-one
,
null-not-start-of-path
,
path-first-in-H
,
reachable-star-def
,
reachable-def
,
Used spec theorems:
Used simplifier rules:
list-last
/reflist/
l-02
list
/reflist/
e-01
list
/reflist/
c
list
/reflist/
app
list-last
/reflist/
l
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic2
/
succ
list-last
/reflist/
last-def
list
/reflist/
a
list-last
/reflist/
l-05