[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-put
⊦ p_ino ∈ dirs ∧ dirs[p_ino] = mkdir(m, md, n0, n1, entries) → subdirs(p_ino, dirs[p_ino, mkdir(m, md, n0, n1, entries[str, ino])]) = (subdirs(p_ino, dirs) \ (str ∈ entries ∧ entries[str] ∈ dirs ⊃ {str} ;∅)) ∪ (ino ∈ dirs ⊃ {str} ;∅)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
afs-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 36
Used lemmas:
subdirs
,
subdirs-add-entry
,
Used spec theorems:
set-basic
/dir-entries/
Extension
Used simplifier rules:
set-union
/dir-entries/
One
heap
/dir-heap/
write-again
set-basic
/dir-entries/
In-insert
set-union
/dir-entries/
unin-01
set-basic
/dir-entries/
ne
set-basic
/dir-entries/
ne-01
set-union
/dir-entries/
Delete
set-union
/dir-entries/
delete-insert
set-basic
/dir-entries/
size-zero-01
set-basic
/dir-entries/
size-zero
set-union
/dir-entries/
diff-add-del
set-union
/dir-entries/
del-e-02
set-union
/dir-entries/
diff-e
set-union
/dir-entries/
unadd
set-basic
/dir-entries/
in-02
set-union
/dir-entries/
Difference
set-union
/dir-entries/
unc
set-union
/dir-entries/
una
set-union
/dir-entries/
une
set-basic
/dir-entries/
in-04
set-basic
/dir-entries/
In-empty
abstract-dir
/
sel-09
set-union
/dir-entries/
del-in-01