[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-no-padding-one
⊦ # buf = a '.flashsize → (abs-nodes(buf, m, a ', lax, false) ↔ lax = @(m, # buf) ' ∧ abs-node(buf, a))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
abs-nodes-no-padding-last
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 8
Used lemmas:
abs-nodes-nospace-h
,
ls-abs-node-buf-size
,
abs-nodes-elems-empty-adr-empty-h
,
abs-nodes-mkbuf0-empty-h
,
flashsize-one
,
abs-nodes-no-padding-rec
,
Used spec theorems:
list
/
One
list
/
c
Used simplifier rules:
abs-node
/
abs-node-unique
node-header-size
/
nodeheader-notzero
nat-basic
/
zero
array
/buffer/
Size-mkarray
array-splice
/buffer/
append-zero-right
list
/laddress-list/
rest
nat-basic
/
c
nat-basic
/
a
abs-node
/
buf-size-zero
nat-basic
/
eq-02
laddress
/
sel-01
laddress
/
sel-02
list
/laddress-list/
first
array-splice
/buffer/
append-a
array-splice
/buffer/
append-len
encoding-node-base
/
node-flash-size
list
/
a
list
/
app
list-data
/laddress-list/
elim-list-c
list
/laddress-list/
c-04
list
/laddress-list/
e
list
/laddress-list/
a
list
/laddress-list/
app
list
/laddress-list/
c
laddress
/
elim