[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-ins
⊦ ¬ str ∈ sdt → sdt[str, tree].fids = sdt.fids ∪ tree.fids
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
fids-del
,
fids-in
,
fids-put1
,
fids-put2
,
fids-put3
,
fids-strpath
,
fids-sub
,
Used by units in proved state:
posix-asm
,
posix-base
,
posix-links
,
Proof exists?: No