[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 dlls-last-base
⊦ dlls(hd, lst, prv, nxt, []) = (emp ∧ ⌜hd = nxt⌝ ∧ ⌜lst = prv⌝ )
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
dll-trav-end
,
dll-trav-next
,
dlls-last-consecutive
,
dlls-last-fold-tail
,
dlls-last-head-null
,
dlls-last-one
,
dlls-last-unfold-head-simp
,
dlls-unfold-tail
,
Used by units in proved state:
Proof exists?: No