[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 fromnext-reachable-rev
⊦ reachable(h[r].nxt, r0, h) ∧ r ≠ r0 ∧ r ≠ null ∧ r ∈ h → (reachable(r, r0, h) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
add-preserves-reachable
,
add-preserves-reachable-rev
,
modnotreachable-reachable
,
modnotreachable-reachable-rev
,
reachable-split-first
,
reachable-trans
,
rem-reachable
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
path-cons
,
reachable-def
,
Used spec theorems:
Used simplifier rules:
list-last
/
last-rec
list
/
a