[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 33 from proof refine-sync (previous step)

remove-refsize0(gstore2) = gstore2, remove-refsize0(istore1) = istore1, elems nx0 ∩ ginval0 = ∅, dom gstore2 ∪ elems nx0 = dom gstore0 ∪ ginval0, pstate ≠ readonly, pstate ≠ unbuffered, btree-inv(rp, adr, istore2, istore1, zh, fi, fi0), inv(gstore0 \ ginval0), inv(gstore2), inv(istore2), inv(istore1), ri-inj(fi), ri-inj(fi0), istore1 ⊑ istore2, ¬ dups(nx0), pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore0, pstate.index? → pstate.lnum ∈ istore2 ⊦ ⟪fail_or_success#(; ; err); syn0 := err = ESUCCESS; skip or pstate := readonly⟫ ⟨index_sync#(fi, fi0, ginval0, gstore0, gstore2, nx0, maxino0, ginval2; ; syn1, err0)⟩ ((syn1 ↔ syn0) ∧ err = err0)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 34:
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, fi, fi0), inv(istore1), inv(istore2), inv(gstore2), inv(gstore0 \ ginval0), ri-inj(fi0), ri-inj(fi), istore1 ⊑ istore2, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore0 ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; syn0 := err = ESUCCESS; skip or pstate := readonly⟫ ⟨index_sync#(fi, fi0, ginval0, gstore0, gstore2, nx0, maxino0, ginval2; ; syn1, err0)⟩ ((syn1 ↔ syn0) ∧ err = err0), pstate = readonly, pstate = unbuffered, dups(nx0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};