[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-open
root.dir?, fids-cons(root, fs, ofh) ⊦ ⟪posix_open#(path, mode, user, root, fs; fd, err, 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: 2
Proof steps: 20
Used lemmas:
fids-cons-reduce
,
open
,
Used spec theorems:
open-file-handles-ext
/
ex-minimal-new-fd
Used simplifier rules:
set-basic
/fidset/
In-insert
file-handle
/
sel-05
posix-base
/
ofh-fids-new
directory-tree
/
fnode-elim
directory-tree
/
isfnode
directory-tree-fids
/
fids-path
posix-pre
/
pre-open-esuccess
posix-pre
/
pre-open-efail