[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 in-plinks
⊦ p ∈ links(fid, tree) ↔ p ∈ tree ∧ tree[p] = fnode(fid)
Type: An axiom
Validity: The proof is valid.
Features: lws,
Comment:
Used by:
links1
,
linksd0
,
plinks-fids
,
plinksd+
,
Used by units in proved state:
Proof exists?: No