[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 node-cons
⊦ node-cons(key, nd) ↔ (nd.inode? → key.inode? ∧ key.ino ≠ 0) ∧ (nd.dentry? → key.dentry?) ∧ (nd.data? → key.data?) ∧ (nd.trunc? → key.inode?)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
datanode-cons
,
dentrynode-cons
,
inodenode-cons
,
key-node-cons
,
truncnode-cons
,
Used by units in proved state:
Proof exists?: No