[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
,
Proof step 28 from proof inv-seek (
previous step
)
⊦ fids-cons(root, fs, ofh) ∧ fd ∈ ofh ∧ ofh[fd] = mkfh(fid, mode, m) → fid ∈ fs
Lemma
fid-in-fs