[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 35 from proof prepost-create-gcheap (previous step)

# lpt1 = n1 + n0, lpt1[n0] = mklp(m, m0, LP_GROUP_NODES, m1), gc-heap(lpt2, log, n0) = keyset(gch), keyset(gch0) = gc-heap(lpt2, log, n0) ++ key-index(m, n0), bin-heap-inv(gch, lpt1), bin-heap-inv(gch0, lpt), id-idx(lpt2, lpt1), id-idx(lpt1, lpt), # lpt ≤ n1 + n0, ∀ ki. ki ∈ gc-heap(lpt2, log, ki.idx) → ki.idx ≠ n0 ⊦ n1 = 0, n0 ∈ log, gc-heap(lpt2, log, n0 + 1) = gc-heap(lpt2, log, n0) ++ key-index(m, n0) ∧ n0 < # lpt

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 36:
⊦ id-idx(lpt1, lpt0) ↔ # lpt0 = # lpt1 ∧ (∀ n. n < # lpt0 → lpt1[n].ref-size = lpt0[n].ref-size ∧ lpt1[n].size = lpt0[n].size ∧ lpt1[n].flags = lpt0[n].flags)
Proof step 37:
# lpt = # lpt1, # lpt1 = n1 + n0, lpt1[n0] = mklp(m, m0, LP_GROUP_NODES, m1), gc-heap(lpt2, log, n0) = keyset(gch), keyset(gch0) = gc-heap(lpt2, log, n0) ++ key-index(m, n0), bin-heap-inv(gch0, lpt), bin-heap-inv(gch, lpt1), id-idx(lpt2, lpt1), # lpt ≤ n1 + n0, ∀ ki. ki ∈ gc-heap(lpt2, log, ki.idx) → ki.idx ≠ n0, ∀ n. n < # lpt → lpt1[n].ref-size = lpt[n].ref-size ∧ lpt1[n].size = lpt[n].size ∧ lpt1[n].flags = lpt[n].flags ⊦ n1 = 0, n0 ∈ log, gc-heap(lpt2, log, n0 + 1) = gc-heap(lpt2, log, n0) ++ key-index(m, n0) ∧ n0 < # lpt

Rule argument

spec: index-array, inst: gc-heap-base name: id-idx seq: ⊦ id-idx(lpt1, lpt0) ↔ # lpt0 = # lpt1 ∧ (∀ n. n < # lpt0 → lpt1[n].ref-size = lpt0[n].ref-size ∧ lpt1[n].size = lpt0[n].size ∧ lpt1[n].flags = lpt0[n].flags) subst: [lpt0, lpt1] → [lpt, lpt1] flags: <all paths>

Additional information

Used terms: lpt, lpt1