[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 13 from proof icrash-inv (previous step)
| inv(istore), n ∈ istore, n ∈ istore0, istore0 ⊑ istore
⊦ istore0[n].ref-size = 0, inv(indexblock(istore[n].indlist, istore[n].ladrlist, istore0[n].ref-size)) |
Heuristic elimination applied rule insert elim lemma
And closed the goal!
Rule argument
spec: ablock, inst: index-store
name: elim
seq: ⊦ (indx = iblock.indlist ∧ lax = iblock.ladrlist)
∧ m = iblock.ref-size
↔ iblock = indexblock(indx, lax, m)
subst: [iblock, indx, lax, m] → [istore[n], indx, lax, m]Additional information
Used simplifier rules:
fwd-inv-iblock: ⊦ inv(istore) ∧ n ∈ istore ∧ istore[n] = iblock → inv(iblock);% ⊦ inv(indexblock(indx, lax, m0)) → inv(indexblock(indx, lax, n0)); (s)%⊦ (indx = iblock.indlist ∧ lax = iblock.ladrlist)
∧ m = iblock.ref-size
↔ iblock = indexblock(indx, lax, m); (elim)
Used terms: istore[n], indx, lax, m