[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 term-restore-log
elems nx ∩ ginval = ∅, elems nx ⊆ dom gstore, inv(gstore) ⊦ ⟪gjournal_restore_log#(nx, ri, fi, ginval, gstore, gstore0, nx0, maxino, ns, boolvar0; log; err)⟫ true
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-recover
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 13
Used lemmas:
term-remove-nonend-blocks
,
restore-log
,
Used spec theorems:
Used simplifier rules:
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
store+set
/group-store-ablock-store-nat-store/
Dom
set-basic
/nat-set/
sub-add-03
list
/nat-list-set/
e-01
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
set-union
/nat-set/
int-c
oelem
/nat-set/
irreflexivity