[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 inv-close
root.dir?, fids-cons(root, fs, ofh) ⊦ ⟪posix_close#(fd, user, root; err, fs, ofh)⟫ fids-cons(root, fs, ofh)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 47
Used lemmas:
fid-in-fs
,
fids-cons-reduce
,
close
,
Used spec theorems:
posix-base
/
ofh-fids
Used simplifier rules:
posix-pre
/
pre-close-esuccess
file-handle
/
elim
store
/file-data-store/
Del-in
set-basic
/fidset/
size-zero-01
set-basic
/fidset/
ne-01
file-handle
/
inj
store
/open-file-handles/
Del-at
store
/open-file-handles/
Del-at-strong
store
/open-file-handles/
Del-in
file-handle
/
sel-05
posix-pre
/
pre-close-efail