[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 prefix-rem-alloc
⊦ st0 \ ns ⊑ st \ ns ∧ ¬ n ∈ st → st0 \ (ns ++ n) ⊑ st[n, ablock] \ (ns -- n)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 16
Used lemmas:
blockstore-prefix
,
Used spec theorems:
set-union
/nat-set/
subdef
set-union
/nat-set/
Difference
store+set
/ablock-store-nat-store/
Diff-get
Used simplifier rules:
store+set
/ablock-store-nat-store/
dom-ins
set-union
/nat-set/
diff-add-del
store+set
/ablock-store-nat-store/
dom-rem
ablock
/
elim
set-union
/nat-set/
Difference
store+set
/ablock-store-nat-store/
Dom
store
/ablock-store-nat-store/
in-neq
store+set
/ablock-store-nat-store/
diff-get-add
set-basic
/nat-set/
In-insert
store+set
/ablock-store-nat-store/
Diff-mems-get
set-union
/nat-set/
Delete
store
/ablock-store-nat-store/
At-in-out
store+set
/ablock-store-nat-store/
Diff-ext
store+set
/ablock-store-nat-store/
Diff-get
ablock
/
sel-01
ablock
/
sel-02