[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 lls-to-ls
⊦ lls(r, null, x) = ls(r, x)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 11
Used lemmas:
lls-rec
,
lls-null
,
lls-base
,
Used spec theorems:
heap-sep
/
Eq-P
Used simplifier rules:
linked-list
/
ls-null
linked-list
/
ls-base
heap-sep
/
prop-shift
heap-sep
/
and
heap-sep
/
prop
heap-sep
/
true-rev
heap-sep
/
true-and
heap-sep
/
and-ass
heap-sep
/
and-com
heap-sep
/
emp-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
list
/
c
maplet
/cell-heap/
ex1-shift
list
/
a
linked-list
/
ls-fold1
linked-list
/
ls-unfold2