[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 3 from proof lpt-free-unref-replay-log (previous step)

lpt.mapIndices(elems nx, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx))[n].flags = LP_FREE, n < # lpt, ∀ n. n < # lpt ∧ lpt[n].flags = LP_FREE → lpt[n].ref-size = 0 ⊦ lpt.mapIndices(elems nx, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx))[n].ref-size = 0

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 4:
lpt.mapIndices(elems nx, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx))[n] = mklp(m, m0, lpf, m1), lpf = LP_FREE, n < # lpt, ∀ n. n < # lpt ∧ lpt[n].flags = LP_FREE → lpt[n].ref-size = 0 ⊦ m = 0

Rule argument

spec: lprops name: elim seq: ⊦ ((m = lp.ref-size ∧ m0 = lp.size) ∧ lpf = lp.flags) ∧ m1 = lp.gcheapidx ↔ lp = mklp(m, m0, lpf, m1) subst: [lp, m, m0, lpf, m1] → [lpt .mapIndices (elems nx, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx) ) [n ], m, m0, lpf, m1]

Additional information

Used simplifier rules: ⊦ ((m = lp.ref-size ∧ m0 = lp.size) ∧ lpf = lp.flags) ∧ m1 = lp.gcheapidx ↔ lp = mklp(m, m0, lpf, m1); (elim) Used terms: lpt .mapIndices (elems nx, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx) ) [n ], m, m0, lpf, m1