[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 log-disjoint-istore
⊦ dom gstore0 ∪ elems nx = dom gstore ∪ ginval ∧ elems nx ∩ ginval = ∅ ∧ abs-istore(avol, lpt, istore) ∧ abs-gstore(avol, lpt, gstore, ginval) → dom istore ∩ elems nx = ∅
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 11
Used lemmas:
abs-gstore-def
,
abs-istore-def
,
Used spec theorems:
set-basic
/nat-set/
Extension
Used simplifier rules:
set-basic
/nat-set/
size-zero
set-basic
/nat-set/
size-zero-01
apersistence-base
/
fwd-in-log-in-gstore
set-union
/nat-set/
unc
set-union
/nat-set/
una
apersistence-base
/
elems-in-notin-ginval
set-union
/nat-set/
int-c
set-union
/nat-set/
int-a
apersistence-base
/
elems-def
store+set
/index-store-ablock-store-nat-store/
Dom
set-union
/nat-set/
Intersect
set-basic
/nat-set/
In-empty
nat-basic
/
f
ablock
/index-store/
elim
lprops
/
elim
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M03
lprops
/
disj-02