| # ax = # ndx4, ndx4 + ndx1 = ndx0 + ndx2, abs-log(nx, gstore ↓) = abs-log(nx1, gstore2 ↓) + ax, nodes(gstore ↓, jro) = nodes(gstore2 ↓, jro0)[ax, ndx4], remove-refsize0(gstore0) = gstore0, elems nx ∩ jro = ∅, elems nx1 ∩ jro0 = ∅, (nx.toSet \ nx1.toSet) ∩ dom gstore2 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro, dom gstore0 ∪ elems nx1 = dom gstore2 ∪ jro0, jro2 < jmaxino, p_os < pmaxino, fi2.inos < jmaxino, fi0.inos < pmaxino, fi2[ndx4.keys, ax].inos < jmaxino0, inv(gstore \ jro), inv(gstore2 \ jro0), inv(gstore0), key-cons(ndx1), key-cons(ndx4), new(ax, nodes(gstore2 ↓, jro0)), refsize-cons(gstore2, range fi2), refsize-cons(gstore0, range fi0), refsize-cons(gstore, range fi2[ndx4.keys, ax]), ri-inj(fi2), ri-inj(fi0), ri-inj(fi2[ndx4.keys, ax]), pmaxino ≤ jmaxino0, pmaxino ≤ jmaxino, jmaxino ≤ jmaxino0, fi2.lebs ⊆ dom gstore, fi2.lebs ⊆ dom gstore2, fi0.lebs ⊆ dom gstore0, ndx1.keys.toSet ⊆ dom fi2, ndx4.keys.toSet ⊆ dom fi2, range fi2 ⊆ dom nodes(gstore2 ↓, jro0), fi2[ndx4.keys, ax].lebs ⊆ dom gstore, ndx2.keys.toSet ⊆ dom fi2 ∪ ndx4.keys.toSet, range fi2[ndx4.keys, ax] ⊆ dom nodes(gstore ↓, jro), dom gstore2 ⊆ dom gstore, ⌊err⌋ , jvalid ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro0), jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro) ⊦ jmaxino = 0, jmaxino0 = 0, pmaxino = 0, dups(ndx1.keys), dups(ndx4.keys), dups(ndx4.keys + ndx1.keys), dups(nx), dups(ax), dups(nx1), ∃ ax0, ndx, ndx3. ndx0 + ndx2 = ndx + ndx3 ∧ new(ax0, nodes(gstore2 ↓, jro0)) ∧ # ax0 = # ndx ∧ ¬ dups(ax0) ∧ fi2[ndx4.keys, ax] = fi2[ndx.keys, ax0] ∧ nodes(gstore ↓, jro) = nodes(gstore2 ↓, jro0)[ax0, ndx] ∧ abs-log(nx, gstore ↓) = abs-log(nx1, gstore2 ↓) + ax0 |
Used terms: ax, ndx4, ndx1