[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-echdr
n < # wlar ⊦ valid-wl(apebs, wlar) ∧ wlar[n] = wl-entry(m0, free) ∧ apebs[n] = mkpeb(aechdr(m1), avhdr, buf, m2, boolvar) → (m0 = m1 ↔ true)
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: 0
Proof steps: 3
Used lemmas:
valid-wl
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
wlentry
/
sel-04
wlstatus
/
disj-04
apeb
/
sel-08
wlstatus
/
disj-01
wlstatus
/
disj-05
apeb
/
sel-04
wlentry
/
sel-05
aecheader
/
inj