[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 prepost-restore-log
elems nx ⊆ dom gstore, elems nx ∩ ginval = ∅, inv(gstore \ ginval) ⊦ ⟪gjournal_restore_log#(nx, ri, fi, ginval, gstore, gstore0, nx0, maxino, ns, boolvar0; ax; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ax = abs-log(nx, gstore ↓)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
recovery
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 25
Used lemmas:
prepost-remove-nonend-blocks
,
Used spec theorems:
set-union
/nat-set/
subdef
set-basic
/nat-set/
Extension
Used simplifier rules:
list
/nat-list-set/
app
list
/nat-list-set/
app-05
gjournal-abs
/
abs-log-base
gjournal-abs
/
restore-log-inv
list-data
/nat-list-set/
elim-list-c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
list
/nat-list-set/
len-05
list
/nat-list-set/
e-01
list
/nat-list-set/
c
store+set
/group-store-ablock-store-nat-store/
Dom
set-basic
/nat-set/
size-zero-01
set-basic
/nat-set/
ne-01
set-basic
/nat-set/
In-empty
set-union
/nat-set/
Intersect
apersistence-base
/
elems-def
list
/nat-list-set/
in-append
list
/nat-list-set/
in-rec
set-union
/nat-set/
int-a
set-union
/nat-set/
int-c
ablock-store-inv
/group-store/
prefixn-to-adrs
ablock
/group-store/
elim
apersistence-base
/
fwd-inv-gblock-rem
list
/nat-list-set/
app-03
list
/nat-list-set/
a
gjournal-abs
/
abs-log-append-one
gjournal-abs
/
down-store-at
oelem
/nat-set/
irreflexivity
gjournal-abs
/
down-block-explicit
ablock
/group-store/
sel-02
list
/address-list-set/
app-01
list
/address-list-set/
a