[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 3 from proof inv-add-gnds (previous step)

remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, nx ≠ [], inv(gstore \ ginval), inv(gstore0), inv(gstore[nx.last]), ri-inj(fi), ri-inj(fi0), nx.last ∈ gstore, ¬ dups(nx) ⊦ ⟪index_add_gnds#(gndx, fi, fi0, ginval, gstore0, nx, maxino, ginval0; ax, gstore; syn, err)⟫ (inv(gstore \ ginval) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 4:
fi = fi1, fi0 = fi2, ginval = ginval1, ginval0 = ginval2, remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval2 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval2, inv(gstore[nx.last]), inv(gstore0), inv(gstore \ ginval2), ri-inj(fi1), ri-inj(fi2), nx.last ∈ gstore ⊦ ⟪if nx ≠ [] then {choose lax, err0 with (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ¬ dups(gstore[nx.last].ladrlist + lax) ∧ # lax ≤ # gndx ∧ inv-flashsize(prefixn(# lax, gndx), lax) ∧ (err0 = ESUCCESS ↔ # lax = # gndx) in {ax := lax.to-adr(nx.last), err := err0; gstore[nx.last].gndlist := gstore[nx.last].gndlist + prefixn(# lax, gndx); gstore[nx.last].ladrlist := gstore[nx.last].ladrlist + lax; if err ≠ ESUCCESS then ax := ?}; syn := ?} else abort⟫ (inv(gstore \ ginval2) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval2), nx = [], dups(nx)

Rule argument

pos: right 1

Additional information

Used simplifier rules: add-gnds: ⊦ ;