[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-one
⊦ dls(head, prev, a ', r ', next, tail) = (⌜head = r ∧ tail = head⌝ ∧ head => mkcell(prev, next, a))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
dls-last
,
dls-split
,
Used by units in proved state:
implementation
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
dls-emp
,
dls-rec
,
Used spec theorems:
Used simplifier rules:
heap-sep
/cell-heap/
sep-com
heap-sep
/cell-heap/
sep-ass
heap-sep
/cell-heap/
emp-sep
heap-sep
/cell-heap/
prop-shift
list
/reflist/
rest
list
/reflist/
first
list
/reflist/
e
list
/
a
list
/
app
maplet
/cell-heap/
ex1
heap-sep
/cell-heap/
and
heap-sep
/cell-heap/
prop
heap-sep
/cell-heap/
and-ass
heap-sep
/cell-heap/
and-com
heap-sep
/cell-heap/
true-rev
heap-sep
/cell-heap/
true-and