[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 16 from proof inv-allocate-gnd (previous step)

remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, inv(istore1), inv(istore2), inv(gstore0), inv(gstore \ ginval), istore1 ⊑ istore2, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore ⊦ pstate = readonly, dups(nx), ∃ n. ¬ n ∈ gstore

User applied rule exists right

And obtained the following new goals

Proof step 17:
remove-refsize0(gstore0) = gstore0, remove-refsize0(istore1) = istore1, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, inv(gstore \ ginval), inv(gstore0), inv(istore2), inv(istore1), (dom gstore).max + 1 ∈ gstore, istore1 ⊑ istore2, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore2 ⊦ pstate = readonly, dups(nx)

Rule argument

pos: right 3 terms: (dom gstore).max + 1 abort: F discard: T computed: F

Additional information

Used terms: (dom gstore).max + 1