[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-crash-down
⊦ inv(gstore \ ginval) → nodes(crash(gstore, gstore0, ginval, nx) ↓, ginval) = nodes(gstore ↓, ginval)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 32
Used lemmas:
valid-group-nodes-entire
,
nodes-gstore-at
,
down-store-adr-in-explicit
,
down-block-explicit
,
down-store-at
,
down-store-in
,
nodes-gstore-in
,
Used spec theorems:
store
/node-store/
k-Extension
apersistence-base
/
crash-group-in
ablock-store-inv
/group-store/
in
ablock-store-inv
/group-store/
at
Used simplifier rules:
address-data
/
elim
ablock
/group-store/
elim
store
/group-store-ablock-store-nat-store/
notmemlookup
apersistence-base
/
fwd-inv-gblock-rem
groupnode
/
elim
store
/node-store/
notmemlookup
apersistence-base
/
crash-group-in
ablock
/group-store/
inj
apersistence-base
/
crash-group-at
address-data
/
sel-03
address-data
/
sel-04
address-data
/
sel-05
ablock
/group-store/
sel-01
ablock
/group-store/
sel-02
list-prefixn
/laddress-list/
in-prefixn-samepos
groupnode
/
inj
list-prefixn
/group-store/
prefixn-fulln