[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 write-loop-0
files0 = files1 ⊦ [vfs_write_loop#(n0, inode, n1, buf, dirs; n, err, files0, asynced)] (n = 0 → files0 = files1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
vfs-contracts
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 111
Used lemmas:
write-page
,
write-block
,
write-loop
,
Used spec theorems:
Used simplifier rules:
nat
/
elim-sub
array
/buffer/
Size-mkarray
afs-pre
/
pre-readpage
inode
/
elim
abstract-file
/
elim
nat-basic
/
z-01
error-class
/
not-esuccess
error-class
/
esuccess
afs-pre
/
pre-writepage
inode
/
sel-01
afs-base
/
valid-file-ino
array-copy
/buffer/
size-copy
page
/
emptypage-size
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
page
/
page-size
nat
/
ge
nat-div
/
mod-le-02