[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 114 from proof decode-node (previous step)

# buf = NODE_HEADER_SIZE, # buf1 = align↑(node-size-headerless(nd), 2 * NODE_HEADER_SIZE), is-encoded(nodeheader(node-size-headerless(nd), false), buf), is-encoded(nd, subarray(buf1 + validtrailer + buf0, 0, node-size-headerless(nd))), node-size-headerless(nd) ≤ # buf1 + NODE_HEADER_SIZE + # buf0 ⊦ ∃ buf0, buf3. buf + buf1 = buf0 + buf3 ∧ is-encoded(nodeheader(node-size-headerless(nd), false), buf0) ∧ is-encoded(nd, subarray(buf3, 0, node-size-headerless(nd))) ∧ # buf3 = # buf1

User applied rule exists right

And obtained the following new goals

Proof step 115:
# buf1 = align↑(node-size-headerless(nd), 2 * NODE_HEADER_SIZE), # buf = NODE_HEADER_SIZE, is-encoded(nd, subarray(buf1 + validtrailer + buf0, 0, node-size-headerless(nd))), is-encoded(nodeheader(node-size-headerless(nd), false), buf), node-size-headerless(nd) ≤ # buf1 + NODE_HEADER_SIZE + # buf0 ⊦ buf + buf1 = buf + buf1 ∧ is-encoded(nodeheader(node-size-headerless(nd), false), buf) ∧ is-encoded(nd, subarray(buf1, 0, node-size-headerless(nd))) ∧ # buf1 = # buf1

Rule argument

pos: right 1 terms: buf, buf1 abort: F discard: T computed: T

Additional information

Used terms: buf, buf1