[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 remove-refsize0-refsize-cons
⊦ as ⊆ dom nodes(st) ∧ refsize-cons(st, as) ∧ inv(st) → as ⊆ dom nodes(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:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 27
Used lemmas:
restrict-in
,
size-eq-0
,
refsize-cons-def
,
Used spec theorems:
set-union
/address-store/
subdef
ablock-store-inv
/
inv-store
ablock-store-inv
/
inv-block
ablock-store-inv
/
inv-flashsize
ablock-store-inv
/
in
list
/laddress-list/
in-def
Used simplifier rules:
set-basic
/address-store/
sub-ntrans
set-basic
/address-store/
size-zero-01
set-basic
/address-store/
ne-01
ablock-store-inv
/
notin-notin
ablock
/
elim
ablock-store-inv
/
in-adr-in
ablock
/
sel-03
ablock-store-inv
/
at-remove-refsize0
ablock-store-inv
/
in-remove-refsize0
ablock-nodes
/
in-nodes
store+set
/address-store/
Dom
set-basic
/address-store/
sub-in
ablock
/
sel-01
ablock
/
sel-02
address-data
/
sel-03
address-data
/
sel-05
address-data
/
sel-04
list-dup
/laddress-list/
a
nat-basic
/
s-04
list-dup
/laddress-list/
f-01
nat-basic
/
succ
list
/laddress-list/
len-05
list
/laddress-list/
len
list
/laddress-list/
c
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c
list-del
/laddress-list/
get-app
list
/laddress-list/
a
laddress
/
sel-01
ablock-store-inv
/
flashsize-neq-0