[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 29 from proof refine-get-gc-block (previous step)

remove-refsize0(istore1) = istore1, remove-refsize0(gstore2) = gstore2, elems nx0 ∩ ginval0 = ∅, dom gstore2 ∪ elems nx0 = dom gstore0 ∪ ginval0, btree-inv(rp, adr, istore2, istore1, zh, fi2, fi1), inv(istore1), inv(istore2), inv(gstore2), inv(gstore0 \ ginval0), ri-inj(fi1), ri-inj(fi2), n2 ∈ gstore2, n2 ∈ gstore0, istore1 ⊑ istore2, ¬ dups(nx0), ¬ n2 ∈ nx0, pstate = unbuffered → syn0, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore0 ⊦ ∃ n1. n1 ∈ gstore0 ∧ ¬ n1 ∈ nx0 ∧ ⟨n0 := n1; err := ESUCCESS⟩ (n2 = n0 ∧ ESUCCESS = err)

User applied rule exists right

And obtained the following new goals

Proof step 30:
remove-refsize0(gstore2) = gstore2, remove-refsize0(istore1) = istore1, elems nx0 ∩ ginval0 = ∅, dom gstore2 ∪ elems nx0 = dom gstore0 ∪ ginval0, btree-inv(rp, adr, istore2, istore1, zh, fi2, fi1), inv(gstore0 \ ginval0), inv(gstore2), inv(istore2), inv(istore1), ri-inj(fi2), ri-inj(fi1), n2 ∈ gstore0, n2 ∈ gstore2, istore1 ⊑ istore2, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore0, pstate.index? → pstate.lnum ∈ istore2, pstate = unbuffered → syn0 ⊦ n2 ∈ gstore0 ∧ ¬ n2 ∈ nx0 ∧ ⟨n0 := n2; err := ESUCCESS⟩ (n2 = n0 ∧ ESUCCESS = err), dups(nx0), n2 ∈ nx0

Rule argument

pos: right 1 terms: n2 abort: F discard: T computed: T

Additional information

Used terms: n2