[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 map-put-rw
r ∈ h ⊦ (r => o * hP)(h) → ((r => o0 * hP)(h(r := o1)) ↔ o0 = o1)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
map-ex-maplet
,
map-separation
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
maplet
,
map-write
,
map-in
,
Used spec theorems:
map-sep
/
sep
heapfuns-map
/
write-left
Used simplifier rules:
map-sep
/
sep-ass
map-sep
/
sep-com
map
/
In-insert
heapfuns-map
/
disj-singleton-write
heapfuns-map
/
in-uni
map
/
put-same