[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 fids-cons
⊦ fids-cons(root, fs, ofh) ↔ (∀ fid. fid ∈ fs ↔ fid ∈ root.fids ∨ fid ∈ ofh.fids)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
fids-cons-in
,
Used by units in proved state:
posix-asm
,
Proof exists?: No