[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 inv-alloc
⊦ inv(st \ ns) → (inv(st[n, ablock] \ (ns -- n)) ↔ inv(ablock))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
apersistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 20
Used lemmas:
inv-flashsize-size
,
inv-block
,
inv-store
,
Used spec theorems:
store+set
/ablock-store-nat-store/
rem-write
Used simplifier rules:
ablock
/
elim
store+set
/ablock-store-nat-store/
rem-write-other
store
/ablock-store-nat-store/
In-insert
store+set
/ablock-store-nat-store/
Diff-mems-get
set-union
/nat-set/
Delete
store
/ablock-store-nat-store/
At-same
ablock
/
inj
store
/ablock-store-nat-store/
insin
store
/ablock-store-nat-store/
in-neq
store
/ablock-store-nat-store/
At-other
store+set
/ablock-store-nat-store/
Diff-ext
store+set
/ablock-store-nat-store/
Diff-get
ablock
/
sel-01
ablock
/
sel-02