[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 27 from proof abs-nlinks-h (
previous step
)
⊦ str ' ∈ tree ↔ (∃ md, sdt. tree = dnode(md, sdt) ∧ str ∈ sdt)
A spec-lemma