[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 nodes-write-nochange
⊦ n ∈ gstore ∧ gblock.gndlist = gstore[n].gndlist ∧ gblock.ladrlist = gstore[n].ladrlist → nodes(gstore[n, gblock], ginval) = nodes(gstore, ginval)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 16
Used lemmas:
nodes-gstore-at
,
nodes-gstore-in
,
Used spec theorems:
store
/node-store/
k-Extension
ablock-store-inv
/group-store/
in
Used simplifier rules:
ablock
/group-store/
elim
address-data
/
elim
address-data
/
sel-05
address-data
/
sel-04
ablock-store-inv
/group-store/
at-write-same
ablock-store-inv
/group-store/
in-write-same
ablock
/group-store/
sel-02
ablock
/group-store/
sel-01
groupnode
/
elim
address-data
/
sel-03
groupnode
/
sel
store
/node-store/
notmemlookup
ablock-store-inv
/group-store/
in-in-adr