[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-lasso-inj-gen
h0 ⊆ h, h1 ⊆ h, (r => a × r0 * lls(r0, r1, x) * lls(r1, r, y))(h0), (r => a × r0 * lls(r0, r1, x) * lls(r1, r, z))(h1) ⊦ y = z
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lls-lasso-inj
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 22
Used lemmas:
lls-unfold-tail
,
lls-rec
,
lls-base
,
Used spec theorems:
list
/
c-06
heap-sep
/
sep
Used simplifier rules:
heap-sep
/
and-com
heap-sep
/
and-ass
heap-sep
/
prop
heap-sep
/
and
heap-sep
/
sep-com
heap-sep
/
sep-ass
heap-sep
/
prop-shift
heap-sep
/
emp-sep
list
/
app-02
list
/
e
list
/
c
list
/
a
maplet
/
ex1-shift
maplet
/
map-same
heap-sep
/
false-sep
heap-sep
/
falseH
heapfuns
/
union-subset
maplet
/
maplet-unique
cell
/
inj-tim
list
/
Last
heap-sep
/
split-union