[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 abs-nodes-emptyheader-h
⊦ isempty(buf, 0, NODE_HEADER_SIZE) → (abs-nodes(buf, m, x, lax, weak) ↔ (# buf = 0 ∨ abs-failed(buf) ∧ weak) ∧ x = [] ∧ lax = [])
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 21
Used lemmas:
ls-abs-node-buf-size
,
abs-nodes-nospace-h
,
abs-nodes-headerspace
,
abs-nodes-mkbuf0-empty-h
,
abs-nodes-first-adr-explicit
,
abs-nodes-rec
,
abs-nodes-elems-empty-adr-empty-h
,
abs-nodes-base
,
Used spec theorems:
abs-node
/
abs-padding
abs-node
/
abs-node
Used simplifier rules:
abs-node
/
abs-padding-abs-failed-append
list
/
c
laddress
/
elim
list
/
a
nat-basic
/
add-base
abs-node
/
buf-size-zero
list
/
e-01
nat
/
le-def
abs-node
/
abs-padding-nospace
eraseblock
/
isempty-elim-right
abs-node
/
abs-padding-isempty
list-data
/laddress-list/
elim-list-c
list
/laddress-list/
a
list
/laddress-list/
e-01
list
/laddress-list/
c
array-splice
/buffer/
append-len
node-header-size
/
validtrailer-size
array-splice
/buffer/
append-a
nat-mult
/
numeral-19
nat-mult
/
one
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
a
nat-basic
/
c
abs-node
/
lfw-is-encoded-nodeheader-size
eraseblock
/
isempty-elim-right0
eraseblock
/
isempty-empbuf
nat-basic
/
eq-01
array-splice
/buffer/
emparray-len
encoding-node-base
/
is-encoded-empbuf