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

gstore0[m] = groupblock(gndx, lax, m2), gstore1[m] = groupblock(gndx0, lax0, m3), gstore1 =○refsize gstore0, @(m0, m1) ∈ lax, m ∈ gstore0 ⊦ m ∈ ginval, m ∈ gstore1 ∧ @(m0, m1) ∈ lax0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 26:
⊦ gstore =○refsize gstore0 ↔ (∀ n. (n ∈ gstore ↔ n ∈ gstore0) ∧ gstore[n].gndlist = gstore0[n].gndlist ∧ gstore[n].ladrlist = gstore0[n].ladrlist)
Proof step 27:
gstore1[m] = groupblock(gndx0, lax0, m3), gstore0[m] = groupblock(gndx, lax, m2), m ∈ gstore0, @(m0, m1) ∈ lax, ∀ n. (n ∈ gstore1 ↔ n ∈ gstore0) ∧ gstore1[n].gndlist = gstore0[n].gndlist ∧ gstore1[n].ladrlist = gstore0[n].ladrlist ⊦ m ∈ ginval, m ∈ gstore1 ∧ @(m0, m1) ∈ lax0

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