[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 ls-unique-strng
⊦ (o[ls(r, x)] * hR)[rs, cf, af] ∧ (o[ls(r, x0)] * hR0)[rs, cf, af] → (x = x0 ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
ls-unique
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 9
Used lemmas:
ls-rec
,
ls-null
,
ls-base
,
Used spec theorems:
heap-aux
/cell-heap-aux/
ex1-shift
Used simplifier rules:
embed-aux
/cell-heap-aux/
embed-and
embed-aux
/cell-heap-aux/
lift-emp
embed-aux
/cell-heap-aux/
lift-prop
heap-sep
/heap-aux-inst/
prop-shift
heap-sep
/heap-aux-inst/
emp-sep
embed-aux
/cell-heap-aux/
and-split
heap-aux
/cell-heap-aux/
prop
heap-sep
/heap-aux-inst/
and-ass
heap-sep
/heap-aux-inst/
and-com
heap-sep
/
false-rev
heap-sep
/
false-and
heap-sep
/
and-ass
heap-sep
/
and-com
embed-aux
/cell-heap-aux/
lift-false
heap-sep
/heap-aux-inst/
false-sep
heap-sep
/heap-aux-inst/
sep-ass
heap-sep
/heap-aux-inst/
sep-com
heap-aux
/cell-heap-aux/
prop-false
heap-aux
/cell-heap-aux/
ex1-shift
heap-sep
/
sep-com
heap-sep
/
sep-ass
embed-aux
/cell-heap-aux/
embed-split
embed-aux
/cell-heap-aux/
lift-ex-r
list
/
a
list
/
c
list
/
e-01
maplet
/cell-heap-aux/
map-null
embed-aux
/cell-heap-aux/
map2
list
/
c-06
cell
/
inj-tim