[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 12 from proof abs-nodes-first-adr-explicit (previous step)

# buf1 = a.alignedsize + 2 * NODE_HEADER_SIZE, lax.head = @(m, # buf1), abs-node(buf1, a), abs-nodes(buf0, m + # buf1, x, lax.tail, weak), ∀ buf2, m, a, x, lax, weak. # buf2 < #(buf1 + buf0) → abs-nodes(buf2, m, a ' + x, lax, weak) → (∃ lax0. lax = lax.head ' + lax0) ⊦ lax = [], ∃ lax0. lax = @(m, # buf1) ' + lax0

Heuristic elimination applied rule insert elim lemma

And closed the goal!

Rule argument

spec: list-data, inst: laddress-list name: elim-list-c seq: lax ≠ [] ⊦ ladr = lax.head ∧ lax0 = lax.tail ↔ lax = ladr + lax0 subst: [lax, ladr, lax0] → [lax, ladr, lax1]

Additional information

Used simplifier rules: ⊦ ladr + lax = ladr ' + lax; (s)% ⊦ ladr ' + lax ≠ []; (s)%a: ⊦ (lax + lax0) + lax1 = lax + lax0 + lax1; from specification list[laddress-list]% ⊦ ladr ' + lax = ladr ' + lax0 ↔ lax = lax0; (s)%lax ≠ [] ⊦ ladr = lax.head ∧ lax0 = lax.tail ↔ lax = ladr + lax0; (elim) Used terms: lax, ladr, lax1