[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 of-cons-reduce
⊦ of-cons(of0, dirs0, files0) → (of-cons(of1, dirs1, files1) ↔ (∀ n. (n ∈ of0 → of0[n].ino ∈ files0) → n ∈ of1 → of1[n].ino ∈ files1))
Type: A user defined theorem
Validity: The proof is valid.
Features: lss,
Comment:
Used by:
inv-close
,
inv-create
,
inv-link
,
inv-mkdir
,
inv-open
,
inv-put-inode
,
inv-read
,
inv-recover
,
inv-renam
,
inv-rmdir
,
inv-seek
,
inv-truncate
,
inv-unlink
,
inv-write
,
inv-writemeta
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 16
Used lemmas:
Used spec theorems:
vfs-base
/
of-cons
Used simplifier rules:
file
/
elim
file
/
sel