[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-one-abs-node
⊦ abs-node(buf, a) → (abs-nodes(buf, m, a ', ladr ', false) ↔ ladr = @(m, a.flashsize))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
abs-nodes-no-padding-last
,
Used by units in proved state:
persistence-refine
,
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 20
Used lemmas:
abs-nodes-mkbuf0-empty-h
,
abs-nodes-elems-empty-adr-empty-h
,
inj-adr
,
abs-nodes-rec
,
ls-abs-node-buf-size
,
Used spec theorems:
abs-node
/
abs-node
list
/
One
list
/
c
abs-node
/
abs-padding
array-splice
/buffer/
append-a
array-splice
/buffer/
append-inj
Used simplifier rules:
encoding-node-base
/
node-flash-size
nat-basic
/
eq-01
list
/laddress-list/
rest
list
/laddress-list/
first
list
/laddress-list/
e
list
/
a
list
/
app
laddress
/
elim
nat-mult
/
two-02
abs-node
/
lfw-is-encoded-nodeheader-size
encoding-fixed-size-nonempty
/encoding-node-header/
is-encoded-unique
node-header
/
inj
array-copy
/buffer/
subarray-elim
laddress
/
inj
array-splice
/buffer/
append-zero-right
array-splice
/buffer/
append-a
array-splice
/buffer/
append-eq-left
array-splice
/buffer/
append-len
node-header-size
/
validtrailer-size
nat-basic
/
a
list
/
e
nat-mult
/
numeral-19
nat-mult
/
one
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
c
abs-node
/
abs-node-full