[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 64 from proof inv-store (previous step)

gstore3[m3] = groupblock(gndx, lax, n1 + m5), fi2[key] = @(m3, m4, m5), gstore3[@(m0, m1, m2)] = mkgnode(nd, m, boolvar, boolvar0), gstore3[m3, groupblock(gndx, lax, n1)][m0] = groupblock(gndx0, lax0, m6), remove-refsize0(gstore2) = gstore2, elems nx ∩ jro0 = ∅, dom gstore2 ∪ elems nx = dom gstore3 ∪ jro0, fi1.inos < pmaxino, fi2.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, inv(gstore3[m3, groupblock(gndx, lax, n1)] \ jro0), inv(gstore2), inv(gstore3 \ jro0), inv(gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)] \ jro0), key-cons(key, nd), refsize-cons(gstore2, range fi1), refsize-cons(gstore3, range fi2), ri-inj(fi1), ri-inj(fi2[key, @(m0, m1, m2)]), ri-inj(fi2), m0 ∈ gstore3[m3, groupblock(gndx, lax, n1)], @(m0, m1, m2) ∈ gstore3, key ∈ fi2, m3 ∈ gstore3, m0 ∈ dom gstore3 ∪ jro0, pmaxino ≤ jmaxino, pmaxino ≤ max(key.ino + 1, jmaxino), fi1.lebs ⊆ dom gstore2, fi2.lebs ⊆ dom gstore3, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro0) ⊦ #(dom gstore3 ∪ jro0) = 0, jmaxino = 0, max(key.ino + 1, jmaxino) = 0, pmaxino = 0, dom gstore3 ∪ jro0 = ∅, dups(nx), refsize-cons(gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)], (range fi2 -- @(m3, m4, m5)) ++ @(m0, m1, m2)), @(m0, m1, m2) ∈ fi2

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 65:
⊦ refsize-cons(gstore, as) ↔ (∀ n. n ∈ gstore → gstore[n].ref-size = (as | n).size)
Proof step 66:
gstore3[m3, groupblock(gndx, lax, n1)][m0] = groupblock(gndx0, lax0, m6), gstore3[@(m0, m1, m2)] = mkgnode(nd, m, boolvar, boolvar0), fi2[key] = @(m3, m4, m5), gstore3[m3] = groupblock(gndx, lax, n1 + m5), remove-refsize0(gstore2) = gstore2, elems nx ∩ jro0 = ∅, dom gstore2 ∪ elems nx = dom gstore3 ∪ jro0, jro1 < jmaxino, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, inv(gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)] \ jro0), inv(gstore3 \ jro0), inv(gstore2), inv(gstore3[m3, groupblock(gndx, lax, n1)] \ jro0), key-cons(key, nd), refsize-cons(gstore3, range fi2), refsize-cons(gstore2, range fi1), ri-inj(fi2), ri-inj(fi2[key, @(m0, m1, m2)]), ri-inj(fi1), m0 ∈ dom gstore3 ∪ jro0, m3 ∈ gstore3, key ∈ fi2, @(m0, m1, m2) ∈ gstore3, m0 ∈ gstore3[m3, groupblock(gndx, lax, n1)], pmaxino ≤ max(key.ino + 1, jmaxino), pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore3, fi1.lebs ⊆ dom gstore2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro0) ⊦ #(dom gstore3 ∪ jro0) = 0, jmaxino = 0, max(key.ino + 1, jmaxino) = 0, pmaxino = 0, dom gstore3 ∪ jro0 = ∅, dups(nx), @(m0, m1, m2) ∈ fi2, ∀ n. n ∈ gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)] → gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)][n].ref-size = (((range fi2 -- @(m3, m4, m5)) ++ @(m0, m1, m2)) | n).size

Rule argument

spec: ablock-store-refsize-cons, inst: group-store name: refsize-cons-def seq: ⊦ refsize-cons(gstore, as) ↔ (∀ n. n ∈ gstore → gstore[n].ref-size = (as | n).size) subst: [as, gstore] → [(range fi2 -- @(m3, m4, m5)) ++ @(m0, m1, m2), gstore3[m3, groupblock(gndx, lax, n1)] [m0, groupblock(gndx0, lax0, m6 + m2) ]] flags: <all paths>

Additional information

Used terms: (range fi2 -- @(m3, m4, m5)) ++ @(m0, m1, m2), gstore3[m3, groupblock(gndx, lax, n1)] [m0, groupblock(gndx0, lax0, m6 + m2) ]