[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-unfold-entry-p
⊦ str ∈ entries ∧ entries[str] ∈ dirs0 ∧ dirs1 ≡ dirs0[entries[str], ad] → (((abs(sdt, entries) * D))(dirs0) ↔ str ∈ sdt ∧ ((abs(sdt[str], entries[str]) * abs(sdt -- str, entries -- str) * D))(dirs0))
Type: A user defined theorem
Validity: The proof is valid.
Features: lws,
Comment:
Used by:
refine-rmdir
,
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:
Used spec theorems:
vfs-abs
/
entries-recdel
Used simplifier rules:
heap-sep
/dir-heap/
true-rev
heap-sep
/dir-heap/
true-and
heap-sep
/dir-heap/
and-ass
heap-sep
/dir-heap/
and-com
heap-sep
/dir-heap/
sep-ass
heap-sep
/dir-heap/
sep-com
vfs-abs
/
entries-dom1