[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-elim
⊦ abs-nodes(buf0, x0, lax0, false) → (abs-nodes(buf0 + buf1, x1, lax1, boolvar1) ↔ (∃ x2, lax2. x1 = x0 + x2 ∧ lax1 = lax0 + lax2 ∧ abs-nodes(buf1, # buf0, x2, lax2, boolvar1)))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
abs-nodes-append
,
abs-nodes-append-empty
,
Used by units in proved state:
persistence-refine
,
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
abs-nodes-nospace-h
,
abs-nodes-append-h
,
abs-nodes-unique-strong-h
,
abs-nodes-prefix-h
,
abs-nodes
,
Used spec theorems:
list-last
/
prefix
list-last
/laddress-list/
prefix
Used simplifier rules:
array-splice
/buffer/
append-a
list
/
a
list
/
app-01
list
/laddress-list/
a
list
/laddress-list/
app-01
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
nat
/
lels