[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-at-other
n ∈ gstore ⊦ n ≠ m0 → nodes(gstore[n, gblock], ginval)[@(m0, m1, m2)] = nodes(gstore, ginval)[@(m0, m1, m2)]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
nodes-append-subseteq
,
nodes-append-subseteq-nodown
,
nodes-write-same-flushed
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 16
Used lemmas:
nodes-gstore-in
,
nodes-gstore-at
,
Used spec theorems:
store
/node-store/
notmemlookup
ablock-store-inv
/group-store/
in
Used simplifier rules:
groupnode
/
elim
ablock-store-inv
/group-store/
notin-notin
ablock-store-inv
/group-store/
in-adr-in
store
/group-store-ablock-store-nat-store/
in-neq
store
/group-store-ablock-store-nat-store/
At-other
address-data
/
sel-05
address-data
/
sel-04
ablock
/group-store/
elim
address-data
/
sel-03
ablock-store-inv
/group-store/
at-explicit-other
groupnode
/
sel
store
/node-store/
notmemlookup
ablock-store-inv
/group-store/
in-in-adr