[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 datakeys-set
⊦ key ∈ datakeys(ks, ri) ↔ key ∈ ri ∧ key.data? ∧ inodekey(key.ino) ∈ ks
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
at-dels-ro-data
,
at-dels-ro-nodata
,
datakeys-put-dentry
,
datakeys-put-inode
,
datakeys-set-add
,
datakeys-set-del
,
datakeys-set-empty
,
in-dels-ro
,
Used by units in proved state:
Proof exists?: No