[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 ex-lst-shift
⊦ (o[_∃ xv] * hR)[rs, cf, af] ↔ (∃ x. (o[xv(x)] * hR)[rs, cf, af])
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
lst-in-hp
,
owner-lst1
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 31
Used lemmas:
ex-lst
,
Used spec theorems:
heap-aux
/cell-heap-aux/
sep
heap-aux
/cell-heap-aux/
apply
embed-aux
/cell-heap-aux/
lift-aux
heap-aux
/cell-heap-aux/
split-uni
Used simplifier rules:
set-basic
/refset/
size-zero-01
set-basic
/refset/
ne-01