[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 assigned-known-getother
⊦ h1 ≡ h0(r := o) ∧ (r => o * r0 => o0 * hP)(h1) → h0(r0) = o0
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
assigned-known-getothermaplet
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 15
Used lemmas:
eq
,
Used spec theorems:
heap-sep
/
sep
maplet
/
maplet
heap
/
ext
heapfuns
/
at-uni
maplet
/
map-in
Used simplifier rules:
heap
/
in-write
heapfuns
/
disj-singleton-write
heap
/
at-write
heap
/
nonnull
heap-sep
/
sep-com
heap-sep
/
sep-ass
maplet
/
map-in
heap
/
in-alloc
heap
/
in-emp
maplet
/
at-rw
heapfuns
/
in-uni