[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 13 from proof replay-log-append-one (previous step)

lpt[n] = mklp(m, m0, lpf, m1), n0 < # lpt ⊦ (n0 ∈ nx ⊃ mklp(lpt[n0].ref-size, LEB_SIZE, LP_GROUP_NODES, lpt[n0].gcheapidx);lpt[n0]) = lpt.mapIndices(elems nx, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx))[n0], n0 = n, n ∈ nx

User applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: array-indices, inst: lp-array name: mapindices-at seq: ⊦ lpt.mapIndices(ns, lptfun)[n] = (n ∈ ns ∧ n < # lpt ⊃ lptfun(lpt[n]);lpt[n]) subst: [n, lptfun, ns, lpt] → [n0, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx), elems nx, lpt] flags: <all paths>

Additional information

Used simplifier rules: ⊦ n ∈ elems nx ↔ n ∈ nx; (s) Used terms: n0, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx), elems nx, lpt