[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 assign-known-weak
⊦ h1 ≡ h0(r := o1) → ((r => o0 * hP)(h0) ↔ (r => o1 * hP)(h1) ∧ h0(r) = o0 ∧ r ∈ h0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 6
Used lemmas:
eq
,
Used spec theorems:
ex-maplet
/
map-putex
ex-maplet
/
mapex
Used simplifier rules:
maplet
/
at-rw
maplet
/
map-in
maplet
/
map-put-rw
heap-sep
/
sep-ass
heap-sep
/
sep-com
maplet
/
map-write
ex-maplet
/
mapex-in
maplet
/
ex1-shift