[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-mkdir
root.dir?, fids-cons(root, fs, ofh) ⊦ ⟪posix_mkdir#(path, md, user, fs, ofh; err, root; psynced)⟫ (root.dir? ∧ 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: 0
Proof steps: 12
Used lemmas:
fids-cons-reduce
,
mkdir
,
Used spec theorems:
Used simplifier rules:
directory-tree
/
dir-put3
directory-tree
/
nil-put
posix-pre
/
pre-mkdir-esuccess
directory-tree
/
nil-in
directory-tree-fids
/
fids-put2
directory-tree-fids
/
fids-dnode
directory-tree-fids
/
fids-emp
bag-union
/fidbag/
union-empty
bag-union
/fidbag/
union-ass
bag-union
/fidbag/
union-com
posix-pre
/
pre-mkdir-efail