[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-reduce
⊦ inv(st \ ns) → (inv(st[n, ablock] \ ns) ↔ n ∈ ns ∨ inv(ablock))
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
Used by units in proved state:
apersistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 11
Used lemmas:
inv-flashsize-size
,
inv-block
,
inv-store
,
Used spec theorems:
Used simplifier rules:
ablock
/
elim
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