[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 31 from proof refine-sync (previous step)

# gndx = # lax, # lpt0 = # avol, # lpt = # avol, (elems nx ∪ dom gstore0) ++ n = dom gstore ∪ ginval, avol[n] = mapped(buf), gstore[n] = groupblock(gndx, lax, m), lpt[n] = mklp(m, # buf, LP_GROUP_NODES, m1), keyset(gch) = gc-heap(lpt, nx + n '), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, ginval ∩ elems nx = ∅, ginval < # avol, n < # avol, abs-istore(avol, lpt, istore), abs-nodes(buf, gndx, lax, # buf = LEB_SIZE), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt, freelist), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), inv(groupblock(gndx, lax, m)), log-group-block(nx + n ', lpt), lpt-free-unref(lpt0), lpt-free-unref(lpt), lpt-leb-size(lpt0), lpt-leb-size(lpt), lpt-ram-flash(lpt, lpt0, nx + n '), n ∈ gstore, # buf ≤ LEB_SIZE, istore0 ⊑ istore, isbuf → synced(avol) ⊦ dups(nx), is-aligned(# buf, 2 * NODE_HEADER_SIZE), n ∈ ginval, n ∈ nx

User applied rule cut formula

And closed the goal!

Rule argument

fma: # buf = LEB_SIZE

Additional information

Used simplifier rules: ⊦ m ≠ n → (m ≤ n ↔ m < n); (s)%⊦ abs-nodes(buf, gndx, lax, false) → is-aligned(# buf, 2 * NODE_HEADER_SIZE); (ss)%mult-a: ⊦ m0 * m * n = (m0 * m) * n; from specification nat-mult%mult-c: ⊦ m * n = n * m; from specification nat-mult% ⊦ m ≤ m; (s)% ⊦ is-aligned(LEB_SIZE, 2 * NODE_HEADER_SIZE); (ss) Used formulas: # buf = LEB_SIZE