[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 dls-rec
⊦ dls(head, prev, a ' + x, rx, next, tail) = _∃(λ r. ⌜rx ≠ [] ∧ head = rx.first⌝ ∧ head => mkcell(prev, r, a) * dls(r, head, x, rx.rest, next, tail))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
dls-last
,
dls-length
,
dls-one
,
dls-split
,
Used by units in proved state:
implementation
,
Proof exists?: No