[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-last
⊦ # x = # rx → dls(head, prev, x + a ', rx + tail0 ', next, tail) = _∃(λ r. ⌜tail0 = tail⌝ ∧ tail => mkcell(r, next, a) * dls(head, prev, x, rx, tail, r))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
implementation
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 31
Used lemmas:
dls-rec
,
dls-one
,
dls-emp
,
Used spec theorems:
heap-sep
/cell-heap/
Eq-P
Used simplifier rules:
list
/
len-02
list
/
len
list
/
c
list-data
/reflist/
size-01
nat-basic2
/
oz
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
list
/reflist/
len-02
list
/reflist/
len
list
/reflist/
c
maplet
/cell-heap/
eq-objs
maplet
/cell-heap/
ex1-shift
list
/reflist/
c-07
list
/reflist/
c-08
list
/reflist/
e-01
list
/reflist/
Nil
list
/
Nil
heap-sep
/cell-heap/
prop
heap-sep
/cell-heap/
and
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-data
/reflist/
l
list-data
/
size-01
heap-sep
/cell-heap/
true-rev
heap-sep
/cell-heap/
true-and
heap-sep
/cell-heap/
and-ass
heap-sep
/cell-heap/
and-com
list
/
a
list
/reflist/
a