[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-gstore-cleanup-lpt
⊦ abs-gstore(avol0, lpt, gstore, ginval) ∧ avol-cleanup-lpt-unchanged(avol0, avol1, lpt) ∧ dom remove-refsize0(gstore) ∩ ginval = ∅ → (¬ abs-gstore(avol1, cleanup-lpt(lpt), remove-refsize0(gstore), ∅) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 30
Used lemmas:
avol-cleanup-lpt-unchanged
,
abs-gstore-def
,
cleanup-lpt
,
Used spec theorems:
array-indices
/lp-array/
map-at
set-basic
/nat-set/
Extension
set-union
/nat-set/
Intersect
Used simplifier rules:
array-indices
/lp-array/
map-size
ablock
/group-store/
elim
lprops
/
elim
nat
/
lels
nat
/
le-ls-simp
nat-basic
/
lf-01
nat-basic
/
f
elem-index
/gc-heap-base/
sel-02
elem-index
/gc-heap-base/
sel-01-M03
lprops
/
inj
lprops
/
disj-01
store
/group-store-ablock-store-nat-store/
notmemlookup
ablock
/group-store/
inj
ablock-store-inv
/group-store/
at-remove-refsize0
set-basic
/nat-set/
In-empty
ablock
/group-store/
sel-03
ablock-store-inv
/group-store/
in-remove-refsize0
store+set
/group-store-ablock-store-nat-store/
Dom
elem-index
/gc-heap-base/
sel-01-M01