[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 45 from proof nodes-except-refsize (previous step)

gndx0[pos(@(m0, m1), lax0)] = mkgnode(nd, m2, boolvar, boolvar0), gndx[pos(@(m0, m1), lax)] = mkgnode(nd0, m3, boolvar1, boolvar2), gstore0[m] = groupblock(gndx, lax, m4), gstore1[m] = groupblock(gndx0, lax0, m5), gstore1 =○refsize gstore0, @(m, m0, m1) ∈ gstore0, @(m, m0, m1) ∈ gstore1 ⊦ nd = nd0, m ∈ ginval

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 46:
⊦ gstore =○refsize gstore0 ↔ (∀ n. (n ∈ gstore ↔ n ∈ gstore0) ∧ gstore[n].gndlist = gstore0[n].gndlist ∧ gstore[n].ladrlist = gstore0[n].ladrlist)
Proof step 47:
gstore1[m] = groupblock(gndx0, lax0, m5), gstore0[m] = groupblock(gndx, lax, m4), gndx[pos(@(m0, m1), lax)] = mkgnode(nd0, m3, boolvar1, boolvar2), gndx0[pos(@(m0, m1), lax0)] = mkgnode(nd, m2, boolvar, boolvar0), @(m, m0, m1) ∈ gstore1, @(m, m0, m1) ∈ gstore0, ∀ n. (n ∈ gstore1 ↔ n ∈ gstore0) ∧ gstore1[n].gndlist = gstore0[n].gndlist ∧ gstore1[n].ladrlist = gstore0[n].ladrlist ⊦ nd = nd0, m ∈ ginval

Rule argument

spec: ablock-store-inv, inst: group-store name: except-refsize-eq seq: ⊦ gstore =○refsize gstore0 ↔ (∀ n. (n ∈ gstore ↔ n ∈ gstore0) ∧ gstore[n].gndlist = gstore0[n].gndlist ∧ gstore[n].ladrlist = gstore0[n].ladrlist) subst: [gstore0, gstore] → [gstore0, gstore1] flags: <all paths>

Additional information

Used terms: gstore0, gstore1