[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-prefix-gen
h0 ⊆ h, h1 ⊆ h, lls(r0, r1, x)(h0), lls(r0, r1, x0)(h1) ⊦ x0 ⊑ x ∨ x ⊑ x0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lls-prefix
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
lls-rec
,
lls-base
,
Used spec theorems:
heap-sep
/
sep
Used simplifier rules:
heap-sep
/
and
heap-sep
/
emp
heap-sep
/
prop
heap-sep
/
and-ass
heap-sep
/
and-com
list-last
/
prefix-nil
list
/
c
maplet
/
ex
list
/
a
heapfuns
/
union-subset
list-last
/
prefix-rec-03
cell
/
inj-tim
maplet
/
maplet-unique