[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 fid-file
⊦ ⌜n⌝ ∈ tree.fids ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) → n ∈ files
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
abs-acyclic
,
file-fid
,
path-in
,
path-in-eq
,
pr
,
pw
,
px
,
py-prefix
,
recovery
,
refine-readmeta
,
refine-unlink
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
Used spec theorems:
posix-base
/
fids-cons
Used simplifier rules:
vfs-abs
/
abs-files-in