[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-consecutive
⊦ (lls(r0, r1, x) * lls(r1, r2, y) * hP)(h) → (lls(r0, r2, x + y) * hP)(h)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
lls-rec
,
lls-base
,
Used spec theorems:
Used simplifier rules:
map-sep
/
emp-sep
map-sep
/
prop-shift
map-sep
/
sep-ass
map-sep
/
sep-com
map-sep
/
and
map-sep
/
prop
map-sep
/
and-ass
map-sep
/
and-com
list
/
Nil
list
/
a
refmap-maplet
/
ex1-shift
list
/
c
refmap-maplet
/
eq-objs