[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-link
root.dir?, fids-cons(root, fs, ofh) ⊦ ⟪posix_link#(path, path', 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: 2
Proof steps: 19
Used lemmas:
fids-cons-reduce
,
link
,
Used spec theorems:
bag-union
/fidbag/
in-union
Used simplifier rules:
directory-tree
/
dir-put3
directory-tree
/
nil-put
posix-pre
/
pre-link-esuccess
directory-tree
/
fnode-elim
directory-tree
/
isfnode
directory-tree-fids
/
fids-fnode
directory-tree-fids
/
fids-put2
directory-tree
/
nil-in
bag-union
/fidbag/
in-one
directory-tree-fids
/
fids-path
posix-pre
/
pre-link-efail