[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 key-cons
⊦ key-cons(key, nd) ↔ nd.key = key ∧ (key.inode? → nd.inode? ∧ key.ino ≠ 0) ∧ (key.dentry? → nd.dentry?) ∧ (key.data? → nd.data?)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
datakey-cons
,
dentrykey-cons
,
in-ri-update-in-ri
,
index-update-dom
,
inodekey-cons
,
key-cons-key
,
log-cons-copy-new
,
ri-cons-inj
,
ri-cons-key
,
ri-cons-truncnode
,
ubifs-cons-ri-inj
,
Used by units in proved state:
gjournal-abs
,
Proof exists?: No