[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-failed-abs-nodes-h
⊦ abs-failed(buf) → (abs-nodes(buf, n, x, lax, weak) ↔ lax = [] ∧ x = [] ∧ weak)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
abs-failed-abs-nodes
,
abs-nodes-nospace-header-h
,
abs-nodes-notrailer-h
,
abs-nodes-unique-weak-h
,
Used by units in proved state:
persistence-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 15
Used lemmas:
abs-nodes-first-adr-explicit
,
abs-nodes-rec
,
abs-nodes-base
,
Used spec theorems:
abs-node
/
abs-failed
Used simplifier rules:
abs-node
/
buf-size-zero
array-splice
/buffer/
append-eq-emptyar
array
/buffer/
Size-mkarray
nat
/
ge
nat
/
lez-01
node-header-size
/
nodeheader-notzero
list
/
e-01
list
/
c
laddress
/
elim
abs-node
/
abs-node-abs-failed
array-splice
/buffer/
append-a
list
/
a
list
/laddress-list/
c
abs-node
/
abs-padding-abs-failed-append