[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 cf-map-unknown
⊦ cf(r) = a × r0 → ((o[r =>_] * hR)[rs, cf, af] ↔ (o[r => a × r0] * hR)[rs, cf, af])
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 43
Used lemmas:
Used spec theorems:
maplet
/cell-heap-aux/
mapex
heap-aux
/cell-heap-aux/
sep
heap-aux
/cell-heap-aux/
split-uni
heap-aux
/cell-heap-aux/
apply
embed-aux
/cell-heap-aux/
lift-aux
maplet
/cell-heap-aux/
maplet
heap
/cell-heap-aux/
ext
Used simplifier rules:
heap-sep
/heap-aux-inst/
sep-com
heap-sep
/heap-aux-inst/
sep-ass
heap-aux
/cell-heap-aux/
ex3-shift-01
embed-aux
/cell-heap-aux/
lift-ex-o
heap-sep
/
falseH
heap-sep
/
false-rev
maplet
/cell-heap-aux/
map-null
heap
/cell-heap-aux/
in-alloc
heap
/cell-heap-aux/
in-emp
heap
/cell-heap-aux/
at-write
heap-fun
/cell-heap-aux/
at-mk
heap-fun
/cell-heap-aux/
in-mk
heap
/cell-heap-aux/
in-write