[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-remove-refsize0-diff
⊦ inv(st \ ns) ∧ dom remove-refsize0(st) ∩ ns = ∅ → inv(remove-refsize0(st))
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: 3
Proof steps: 10
Used lemmas:
at-remove-refsize0
,
in-remove-refsize0
,
inv-flashsize-size
,
inv-block
,
inv-store
,
Used spec theorems:
set-basic
/nat-set/
Extension
Used simplifier rules:
ablock
/
elim
set-basic
/nat-set/
In-empty
ablock
/
sel-02
ablock
/
sel-01
store+set
/ablock-store-nat-store/
Diff-get
store+set
/ablock-store-nat-store/
Diff-ext
set-union
/nat-set/
Intersect
store+set
/ablock-store-nat-store/
Dom
set-union
/nat-set/
int-a
set-union
/nat-set/
int-c
set-basic
/nat-set/
ne-01
ablock
/
sel-03