[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 60 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 = ∅, gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)] =○refsize gstore3, dups(nx), @(m0, m1, m2) ∈ fi2

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 61:
⊦ gstore =○refsize gstore0 → (gstore[n, gblock] =○refsize gstore0 ↔ n ∈ gstore ∧ gblock.gndlist = gstore[n].gndlist ∧ gblock.ladrlist = gstore[n].ladrlist)
Proof step 62:
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 = ∅, gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)] =○refsize gstore3, gstore3[m3, groupblock(gndx, lax, n1)] =○refsize gstore3, dups(nx), @(m0, m1, m2) ∈ fi2

Rule argument

spec: ablock-store-inv, inst: group-store name: except-refsizeeq-write-left seq: ⊦ gstore =○refsize gstore0 → ( gstore[n, gblock] =○refsize gstore0 ↔ n ∈ gstore ∧ gblock.gndlist = gstore[n].gndlist ∧ gblock.ladrlist = gstore[n].ladrlist) subst: [gstore0, gblock, n, gstore] → [gstore3, groupblock(gndx0, lax0, m6 + m2), m0, gstore3[m3, groupblock(gndx, lax, n1)]] flags: <all paths>

Additional information

Used simplifier rules: ⊦ groupblock(gndx, lax, m).gndlist = gndx; (s)% ⊦ groupblock(gndx, lax, m).ladrlist = lax; (s) Used terms: gstore3, groupblock(gndx0, lax0, m6 + m2), m0, gstore3[m3, groupblock(gndx, lax, n1)]