[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 abs-log-gcrash-down
⊦ elems nx ∩ ginval = ∅ ∧ inv(gstore \ ginval) → abs-log(nx, crash(gstore, gstore0, ginval, nx0) ↓) = abs-log(nx, gstore ↓)
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: 6
Proof steps: 20
Used lemmas:
down-block-explicit
,
down-block
,
down-store-in
,
down-store-at
,
abs-log-rec
,
abs-log-base
,
Used spec theorems:
store
/group-store-ablock-store-nat-store/
notmemlookup
Used simplifier rules:
apersistence-base
/
elems-empty
set-union
/nat-set/
int-e
set-union
/nat-set/
int-a
set-union
/nat-set/
int-ins
list
/nat-list-set/
a
apersistence-base
/
elems-prepend
list
/nat-list-set/
c
ablock
/group-store/
elim
set-union
/nat-set/
int-c
apersistence-base
/
fwd-inv-gblock-rem
list
/address-list-set/
a
list
/address-list-set/
app-01
ablock
/group-store/
sel-02
ablock
/group-store/
sel-01
apersistence-base
/
crash-group-in
ablock
/group-store/
inj
apersistence-base
/
crash-group-at