[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-node-abs-failed
⊦ abs-node(buf0, nd) → ¬ abs-failed(buf0 + buf1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
abs-list
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 8
Used lemmas:
abs-failed
,
abs-node
,
Used spec theorems:
array-splice
/buffer/
append-a
array-splice
/buffer/
append-inj
encoding-node-base
/
alignedsize
Used simplifier rules:
align
/
is-aligned-multiplier
align
/
is-aligned-add
encoding-node-base
/
is-aligned-alignedsize
nat-mult
/
two-02
node-header-size
/
node-header-size-add-eq-0
align
/
is-aligned-le-eq-zero
nat
/
ge
node-header
/
elim
abs-node
/
lfw-is-encoded-nodeheader-size
node-header
/
inj
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
encoding-fixed-size-nonempty
/encoding-node-header/
is-encoded-not-garbage-nonempty
nat-mult
/
two-zero-01
node-header-size
/
nodeheader-notzero
nat-mult
/
mult-a
nat-mult
/
mult-c
nat
/
le-add
nat-basic
/
z-01
nat-basic
/
a
nat-basic
/
c
align
/
alignup-same