[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-valid-adrs
⊦ inv(st) ∧ as ⊆ dom nodes(st) → valid-adrs(as)
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: 8
Proof steps: 18
Used lemmas:
valid-adrs
,
Used spec theorems:
ablock-store-inv
/
inv-store
ablock-store-inv
/
inv-block
ablock-store-inv
/
in
list
/laddress-list/
in-def
ablock-store-inv
/
inv-flashsize
Used simplifier rules:
set-basic
/address-store/
size-zero-01
set-basic
/address-store/
ne-01
address-data
/
elim
ablock-nodes
/
in-nodes
store+set
/address-store/
Dom
set-basic
/address-store/
sub-in
ablock-store-inv
/
notin-notin
ablock
/
elim
ablock
/
sel-02
address-data
/
sel-03
address-data
/
sel-05
address-data
/
sel-04
list-dup
/laddress-list/
a
list-dup
/laddress-list/
f-01
list
/laddress-list/
c
nat-basic
/
succ
list
/laddress-list/
len-05
list
/laddress-list/
len
nat
/
lels
ablock-store-inv
/
flashsize-neq-0
laddress
/
sel-01
list
/laddress-list/
a
list-del
/laddress-list/
get-app
nat
/
succ-01
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c