[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-subset-refed
⊦ refsize-cons(st, as) ∧ as ⊆ dom nodes(st) ∧ valid-adrs(as) → nodes(st) | as ⊆ 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: 31
Used lemmas:
restrict-in
,
size-eq-0
,
refsize-cons-def
,
valid-adrs
,
Used spec theorems:
store
/address-store/
Subset
store+set
/address-store/
restrict-at
ablock-store-inv
/
in
ablock-store-inv
/
at-remove-refsize0
ablock-store-inv
/
at
ablock-store-inv
/
in-remove-refsize0
Used simplifier rules:
set-basic
/address-store/
size-zero-01
set-basic
/address-store/
ne-01
store+set
/address-store/
restrict-in
address-data
/
elim
store+set
/address-store/
Dom
set-basic
/address-store/
sub-in
ablock
/
elim
ablock-nodes
/
in-nodes
ablock-nodes
/
at-nodes
ablock-store-inv
/
in-remove-refsize0
ablock-store-inv
/
at-remove-refsize0
ablock-store-inv
/
in-adr-in
ablock
/
sel-03
ablock
/
inj
address-data
/
sel-03
address-data
/
sel-04
ablock
/
sel-01
ablock
/
sel-02
store
/ablock-store-nat-store/
notmemlookup
ablock-store-inv
/
notin-notin
address-data
/
sel-05