[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-prefix-h
⊦ abs-nodes(buf0, m, x0, lax0, boolvar0) ∧ abs-nodes(buf0 + buf1, m, x1, lax1, boolvar1) → x0 ⊑ x1 ∧ lax0 ⊑ lax1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
abs-nodes-bothcrash-prefix
,
abs-nodes-crash-prefix
,
abs-nodes-prefix
,
abs-nodes-prefix-elim
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 33
Used lemmas:
abs-nodes-nospace-h
,
abs-nodes-base
,
ls-abs-node-buf-size
,
abs-nodes-padding-prefix
,
abs-nodes-first-adr-explicit
,
abs-nodes-rec
,
abs-nodes-elems-empty-adr-empty-h
,
Used spec theorems:
abs-node
/
abs-node-no-abs-padding
Used simplifier rules:
list-last
/
prefix-nil
list-last
/laddress-list/
prefix-nil
list
/
c
laddress
/
elim
nat-basic
/
add-base
abs-node
/
abs-padding-mkbuf0
list-data
/laddress-list/
elim-list-c
list
/
e-01
list-last
/
prefix-empty
abs-node
/
abs-node-abs-failed
nat-basic
/
zero
list
/laddress-list/
in-rec
list
/laddress-list/
in-14
abs-node
/
abs-node-unique
array-splice
/buffer/
append-eq-left
list
/
a
list-last
/
prefix-rec-03
abs-node
/
abs-node-abs-node
list-last
/laddress-list/
prefix-rec-02
list
/laddress-list/
a
list
/laddress-list/
e-01
list
/laddress-list/
c
array-splice
/buffer/
append-len
array-splice
/buffer/
append-a
nat
/
lels
nat
/
le-add
abs-node
/
buf-size-zero
nat-basic
/
a
nat-basic
/
c
array
/buffer/
Size-mkarray
nat-basic
/
z-01
nat-mult
/
two-zero-01
node-header-size
/
nodeheader-notzero
nat-mult
/
mult-a
nat-mult
/
mult-c