[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 abs-has-rootpath
⊦ abs(tree, ino0)(dirs) ∧ ino1 ∈ dirs → (∃ p. ispath(p, ino0, ino1, dirs, files))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
abs-delorphans
,
abs-nlinks-h
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
abs-has-rootpath-h
,
Used spec theorems:
Used simplifier rules:
heap-sep
/dir-heap/
this-emp
heap-sep
/dir-heap/
emp-sep
heap-sep
/dir-heap/
sep-ass
heap-sep
/dir-heap/
sep-com
heap
/dir-heap/
in-emp