[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 inj-ls-gen-sep
⊦ (ls(r, x1) * hP1)(h) ∧ (ls(r, x2) * hP2)(h) → x1 = x2
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: 2
Proof steps: 6
Used lemmas:
ls-rec
,
ls-null
,
ls-base
,
Used spec theorems:
Used simplifier rules:
heap-sep
/
prop-shift
heap-sep
/
emp-sep
heap-sep
/
and
heap-sep
/
prop
heap-sep
/
false-rev
heap-sep
/
false-and
heap-sep
/
and-ass
heap-sep
/
and-com
heap-sep
/
false-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
heap-sep
/
falseH
maplet
/
ex1-shift
list
/
a
list
/
c
list
/
app-02
list
/
e
maplet
/
map-null
maplet
/
eq-objs
list
/
c-06
cell
/
inj-tim