[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 31 from proof size-0 (previous step)

# gndx = # lax, (range ri | m).size = 0, gstore[m] = groupblock(gndx, lax, m1), ri[key] = @(m, m0, 0), inv(gstore \ ginval), inv-flashsize(gndx, lax), key-cons(key, nodes(gstore ↓, ginval)[@(m, m0, 0)]), key ∈ ri, @(m0, 0) ∈ prefixn(valid-group-nodes(gndx), lax), m ∈ gstore ⊦ dups(lax), m ∈ ginval

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 32:
⊦ inv-flashsize(gndx, lax) ↔ # gndx = # lax ∧ (∀ n. n < # gndx → lax[n].size = gndx[n].flashsize)
Proof step 33:
# gndx = # lax, (range ri | m).size = 0, ri[key] = @(m, m0, 0), gstore[m] = groupblock(gndx, lax, m1), inv(gstore \ ginval), key-cons(key, nodes(gstore ↓, ginval)[@(m, m0, 0)]), m ∈ gstore, @(m0, 0) ∈ prefixn(valid-group-nodes(gndx), lax), key ∈ ri, ∀ n. n < # gndx → lax[n].size = gndx[n].flashsize ⊦ dups(lax), m ∈ ginval

Rule argument

spec: ablock-store-inv, inst: group-store name: inv-flashsize seq: ⊦ inv-flashsize(gndx, lax) ↔ # gndx = # lax ∧ (∀ n. n < # gndx → lax[n].size = gndx[n].flashsize) subst: [lax, gndx] → [lax, gndx] flags: <all paths>

Additional information

Used terms: lax, gndx