[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-dll-gen
h0 ⊆ h, h1 ⊆ h, dll(r, r0, x)(h0), dll(r, r0, x0)(h1) ⊦ x0 = x
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inj-dll
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 23
Used lemmas:
dll-rec
,
dll-prev-null
,
dll-base
,
Used spec theorems:
list
/
c-06
heap-sep
/
sep
maplet
/
maplet
heapfuns
/
subset
Used simplifier rules:
heap-sep
/
and
heap-sep
/
emp
heap-sep
/
prop
heapfuns
/
emp-subset
heap-sep
/
false-rev
heap-sep
/
false-and
heap-sep
/
and-ass
heap-sep
/
and-com
heap-sep
/
falseH
maplet
/
ex
list
/
a
list
/
c
list
/
app-02
list
/
e
maplet
/
map-null
heap-sep
/
false-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
heapfuns
/
union-subset
heapfuns
/
disj-singleton-write
heap
/
in-alloc
heap
/
in-emp
heap
/
at-write
heap
/
in-write
heap
/
nonnull
node
/
inj-mknode