[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
,
Proof step 4 from proof abs-nodes-split (
previous step
)
⊦ abs-nodes(buf, m, x0 + x1, lax, weak) → (∃ buf0, buf1, lax0, lax1. lax = lax0 + lax1 ∧ buf = buf0 + buf1 ∧ abs-nodes(buf0, m, x0, lax0, false) ∧ abs-nodes(buf1, m + # buf0, x1, lax1, weak))
Lemma
abs-nodes-split-h