[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 crash-gstore-inv
⊦ inv(gstore \ ginval) ∧ inv(gstore0) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval → inv(crash(gstore, gstore0, ginval, nx) \ ginval)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
apersistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 13
Used lemmas:
crash-group-at
,
crash-group-in
,
Used spec theorems:
ablock-store-inv
/group-store/
inv-store
ablock-store-inv
/group-store/
inv-block
Used simplifier rules:
store+set
/group-store-ablock-store-nat-store/
Diff-get
store+set
/group-store-ablock-store-nat-store/
Diff-ext
ablock-store-inv
/group-store/
inv-flashsize-size
ablock
/group-store/
elim
store
/group-store-ablock-store-nat-store/
notmemlookup
ablock
/group-store/
inj