[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 entries-unfold
str ∈ sdt ⊦ ((abs(sdt, sdi) * D))(dirs) ↔ (∃ tree, ino, sdi0, sdt0. ¬ str ∈ sdt0 ∧ sdt = sdt0[str, tree] ∧ ¬ str ∈ sdi0 ∧ sdi = sdi0[str, ino] ∧ ((abs(tree, ino) * abs(sdt0, sdi0) * D))(dirs))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
path-fid
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
entries-recdel
,
entries-dom1
,
entries-dom2
,
entries-del
,
abs-rec
,
Used spec theorems:
store
/dir-entries/
exin
Used simplifier rules:
store
/dir-entries/
insin
heap-sep
/dir-heap/
and-com
heap-sep
/dir-heap/
and-ass
heap-sep
/dir-heap/
true-and
store
/dir-entries/
At-same
store
/dir-entries/
notin-del-notin
store
/dir-entries/
Del-rec-same
heap-sep
/dir-heap/
true-rev
store
/dir-entries/
In-insert
directory-tree-base
/
Del-in
store
/directory-tree-inst/
del-put
store
/directory-tree-inst/
ins-same-01
heap-sep
/dir-heap/
sep-ass
heap-sep
/dir-heap/
sep-com