[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 write-known
⊦ (a[r => o0] * hR)[rs, f, g] ↔ (a[r => o1] * hR)[rs, f(r; o1), g] ∧ f(r) = o0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
map2
,
write-unknown
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 45
Proof steps: 87
Used lemmas:
map-in0
,
switch-obj
,
lift-aux
,
Used spec theorems:
heap-aux
/
sep
heap-aux
/
split-uni
heap-aux
/
apply
maplet
/
maplet
heap
/
ext
Used simplifier rules:
heap-sep
/
falseH
heap-sep
/
false-rev
maplet
/
map-null
heap
/
in-alloc
heap
/
in-emp
heap
/
at-write
heap-fun
/
at-mk
heap-fun
/
in-mk
heap
/
in-write
set-union
/refset/
int-a
set-union
/refset/
int-c
set-union
/refset/
int-empty-02
maplet
/
maplet-singleton-heap
set-basic
/refset/
size-zero-01
set-basic
/refset/
ne-01