[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 subdirs-del-entry
⊦ ino ∈ dirs → subdirs(ino, dirs[ino, mkdir(n, md, n0, n1, entries -- str)]) = (str ∈ entries ∧ entries[str] ∈ dirs ⊃ subdirs(ino, dirs[ino, mkdir(n, md, n0, n1, entries)]) -- str ;subdirs(ino, dirs[ino, mkdir(n, md, n0, n1, entries)]) )
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
subdirs-del-mod-size
,
Used by units in proved state:
afs-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
subdirs
,
Used spec theorems:
set-basic
/dir-entries/
Extension
Used simplifier rules:
store
/dir-entries/
notin-del-notin
set-union
/dir-entries/
Delete
heap
/dir-heap/
in-write
heap
/dir-heap/
at-write
abstract-dir
/
sel-09
store
/dir-entries/
Del-in
store
/dir-entries/
Del-at
store
/dir-entries/
Del-at-strong