[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 icrash-inv
⊦ inv(istore) ∧ istore0 ⊑ istore → inv(remove-refsize0(crash(istore, istore0)))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
apersistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 10
Used lemmas:
fwd-inv-iblock
,
crash-index-at
,
crash-index-in
,
Used spec theorems:
ablock-store-inv
/index-store/
inv-store
ablock-store-inv
/index-store/
at-remove-refsize0
Used simplifier rules:
ablock-store-inv
/index-store/
prefix-fwd-in
ablock-store-inv
/index-store/
in-remove-refsize0
ablock
/index-store/
sel-03
ablock
/index-store/
inj
ablock-store-inv
/index-store/
inv-set-sizes
ablock
/index-store/
elim