[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 at-write-same
st[n].list = x, st[n].ladrlist = lax ⊦ n ∈ st ∧ adr ∈ st → st[n, mkblock(x, lax, m)][adr] = st[adr]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
ablock-nodes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 10
Used lemmas:
in-in-adr
,
in-write-same
,
in
,
at
,
Used spec theorems:
Used simplifier rules:
address-data
/
elim
ablock
/
elim
ablock
/
sel-02
ablock
/
sel-01
address-data
/
sel-05
address-data
/
sel-04
address-data
/
sel-03
store
/ablock-store-nat-store/
At-other
ablock
/
inj
store
/ablock-store-nat-store/
At-same