[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 150 from proof inv-gc-copy (previous step)

# ax = # ndx1, abs-log(nx, gstore3 ↓) = abs-log(nx1, gstore2 ↓) + ax, nodes(gstore3 ↓, jro) = nodes(gstore2 ↓, jro0)[ax, ndx1], remove-refsize0(gstore1) = gstore1, elems nx1 ∩ jro0 = ∅, (nx.toSet \ nx1.toSet) ∩ dom gstore2 = ∅, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx1 = dom gstore2 ∪ jro0, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, jro2 < jmaxino3, p_os < pmaxino, fi2.inos < jmaxino3, fi1.inos < pmaxino, fi2[ndx1.keys, ax].inos < jmaxino0, inv(gstore3[nx.last]), inv(gstore2 \ jro0), inv(gstore1), inv(gstore3 \ jro), key-cons(ndx1), key-cons(ndx4), new(ax, nodes(gstore2 ↓, jro0)), refsize-cons(gstore2, range fi2), refsize-cons(gstore1, range fi1), refsize-cons(gstore3, range fi2[ndx1.keys, ax]), ri-inj(fi2), ri-inj(fi1), ri-inj(fi2[ndx1.keys, ax]), nx.last ∈ gstore3, jmaxino3 ≤ jmaxino0, pmaxino ≤ jmaxino3, pmaxino ≤ jmaxino0, fi2.lebs ⊆ dom gstore3, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, ndx1.keys.toSet ⊆ dom fi2, ndx4.keys.toSet ⊆ dom fi2, range fi2 ⊆ dom nodes(gstore2 ↓, jro0), fi2[ndx1.keys, ax].lebs ⊆ dom gstore3, range fi2[ndx1.keys, ax] ⊆ dom nodes(gstore3 ↓, jro), dom gstore2 ⊆ dom gstore3, jvalid1 → valid-journal-head(nx, gstore3, jro), jvalid7 ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro0) ⊦ jmaxino3 = 0, ndx4 = [], nx = [], pmaxino = 0, dups(ax), dups(nx), dups(nx1), dups(ndx1.keys + ndx4.keys), dups(ndx1.keys), dups(ndx4.keys), ∃ n0. n0 ≤ LEB_SIZE

Proof step 150 from proof inv-gc-copy (previous step)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

Additional information