[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-padding-abs-nodes-h
⊦ abs-padding(buf) → (abs-nodes(buf, m, x, lax, 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-refine
,
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 29
Used lemmas:
ls-abs-node-buf-size
,
abs-nodes-nospace-h
,
abs-nodes-first-adr-explicit
,
abs-nodes-rec
,
abs-nodes-mkbuf0-empty-h
,
abs-nodes-elems-empty-adr-empty-h
,
abs-nodes-base
,
Used spec theorems:
abs-node
/
abs-padding
abs-node
/
abs-node
array-splice
/buffer/
append-a
array-splice
/buffer/
append-inj
Used simplifier rules:
node-header-size
/
node-header-size-add-eq-0
array-splice
/buffer/
append-zero-right
array-splice
/buffer/
append-eq-left
abs-node
/
abs-padding-full
list
/
c
laddress
/
elim
list
/laddress-list/
in-rec
list
/laddress-list/
in-14
array-splice
/buffer/
append-inj
array-splice
/buffer/
append-prefix-left
abs-node
/
buf-size-zero
array
/buffer/
Size-mkarray
nat-basic
/
zero
node-header-size
/
nodeheader-notzero
list
/
e-01
list
/
a
list-data
/laddress-list/
elim-list-c
list
/laddress-list/
a
list
/laddress-list/
e-01
list
/laddress-list/
c
nat-mult
/
two-02
nat-basic
/
eq-01
abs-node
/
lfw-is-encoded-nodeheader-size
nat-basic
/
c
nat-basic
/
a
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
one
nat-mult
/
numeral-19
array-splice
/buffer/
append-a
node-header-size
/
validtrailer-size
array-splice
/buffer/
append-len
encoding-fixed-size-nonempty
/encoding-node-header/
is-encoded-unique
node-header
/
inj