[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-add-crash-aligned
⊦ abs-nodes(buf0, x, lax, false) ∧ abs-node(buf1, a) → (abs-nodes((buf0 + buf1).align↓, x + a ', lax + @(# buf0, a.flashsize) ', boolvar) ↔ is-aligned(# buf0 + # buf1, EB_PAGE_SIZE))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
abs-nodes-add-crash-aligned-nodes
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 17
Used lemmas:
abs-nodes-mkbuf0-empty-h
,
abs-nodes-rec
,
abs-nodes-append-h
,
abs-nodes-unique-strong-h
,
abs-nodes-add-crash-aligned-h
,
ls-abs-node-buf-size
,
abs-nodes
,
Used spec theorems:
awbuf-inv
/
down-arrow-buf
node-header-size
/
is-aligned-pagesize-imp-headersize
awbuf-inv
/
align-down-is-aligned
list
/
One
list
/
c
abs-node
/
abs-node
Used simplifier rules:
align
/
aligndown-same-equiv
encoding-node-base
/
node-flash-size
align
/
aligndown-is-smaller-01
align
/
is-aligned-zero
node-header-size
/
nodeheader-notzero
abs-node
/
abs-node-unique
eraseblock
/
page-size
align
/
aligndown-is-aligned
list
/laddress-list/
a
list
/laddress-list/
rest
abs-node
/
buf-size-zero
nat-basic
/
eq-02
laddress
/
sel-01
laddress
/
sel-02
list
/laddress-list/
first
list
/laddress-list/
e
list
/
a
list
/
app
nat-mult
/
two-02
nat-basic
/
eq-01
abs-node
/
lfw-is-encoded-nodeheader-size
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
one
nat-mult
/
numeral-19
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
array
/buffer/
Size-mkarray
nat-basic
/
add-base
nat-basic
/
c
list
/
e
abs-node
/
abs-node-full