[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-push
⊦ (o[ls(r, x)] * true)[rs, cf, af(r; o)] ∧ (o0[r => a × r0] * true)[rs, cf, af] ∧ o ≠ o0 ∧ (o[ls(r0, x0)] * true)[rs, cf, af] → (x = a ' + x0 ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
ls-unique
,
ls-rec
,
ls-base
,
Used spec theorems:
embed-aux
/cell-heap-aux/
aux-known
list
/
firsteq-01
Used simplifier rules:
heap-sep
/heap-aux-inst/
sep-com
heap-sep
/heap-aux-inst/
sep-ass
heap-aux
/cell-heap-aux/
true-elim
embed-aux
/cell-heap-aux/
merge-owned-rewrite
list
/
e-01
list
/
a
embed-aux
/cell-heap-aux/
embed-and
embed-aux
/cell-heap-aux/
lift-emp
embed-aux
/cell-heap-aux/
lift-prop
heap-sep
/
and-ass
heap-sep
/
and-com
heap-sep
/heap-aux-inst/
prop-shift
heap-sep
/heap-aux-inst/
emp-sep
heap-sep
/heap-aux-inst/
true-and
heap-sep
/heap-aux-inst/
and-ass
heap-sep
/heap-aux-inst/
and-com
heap-aux
/cell-heap-aux/
prop
maplet
/cell-heap-aux/
map-null
heap-sep
/
false-rev
embed-aux
/cell-heap-aux/
lift-false
heap-sep
/heap-aux-inst/
false-sep
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
/
c
list
/
e
list
/
first
list
/
rest
list
/
Nil
embed-aux
/cell-heap-aux/
map2
cell
/
inj-tim