[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 valid-wl-free
m < # wlar ⊦ valid-wl(apebs, wlar) → (valid-wl(apebs, wlar[m, wl-entry(m1, free)]) ↔ apebs[m].echdr = aechdr(m1) ∧ apebs[m].vidhdr = empty ∧ ¬ apebs[m].bad)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 20
Used lemmas:
valid-wl
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
array
/wlarray-base/
Size-put
apeb
/
elim
wlentry
/
elim-02
array
/wlarray-base/
cngetput
array
/wlarray-base/
Put-same
wlentry
/
inj-03
apeb
/
inj
wlstatus
/
disj-04
wlstatus
/
disj-05
array
/wlarray-base/
Put-other
aecheader
/
inj
valid-peb
/
valid-peb-vidhdr-empty
wlentry
/
sel-04
apeb
/
sel-08
apeb
/
sel-05
apeb
/
sel-04
wlentry
/
sel-05
wlstatus
/
disj-02
wlstatus
/
disj-01
valid-peb
/
valid-peb-unique