[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-merge-gen
h0 ⊆ h, (lls(r0, r1, x0) * lls(r1, r2, x1))(h0) ⊦ lls(r0, r2, x0 + x1)(h0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lls-merge
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 8
Used lemmas:
lls-rec
,
lls-base
,
Used spec theorems:
heap-sep
/
sep
Used simplifier rules:
heap-sep
/
prop-shift
heap-sep
/
emp-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
heap-sep
/
and
heap-sep
/
prop
heap-sep
/
and-ass
heap-sep
/
and-com
list
/
Nil
list
/
a
maplet
/
ex
list
/
c
maplet
/
ex1-shift
heapfuns
/
union-subset
heap-sep
/
precise-split-l
maplet
/
precise-map