[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-injective
⊦ (lls(r, r0, x) * hP1)(h) ∧ (lls(r, r1, x) * hP2)(h) → r0 = r1
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
lls-rec
,
lls-base
,
Used spec theorems:
Used simplifier rules:
heap-sep
/
prop
heap-sep
/
prop-shift
heap-sep
/
emp-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
heap-sep
/
and
heap-sep
/
false-rev
heap-sep
/
falseH
heap-sep
/
and-ass
heap-sep
/
and-com
maplet
/
eq-objs
cell
/
inj-tim
maplet
/
ex1-shift
list
/
a
list
/
c