[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 139 from proof inv-commit (previous step)

zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), zh[rp] = mkznode(r, zbrar, boolvar, true, m), istore1[m0] = indexblock(indx, lax, m3), remove-refsize0(istore2) = istore2, remove-refsize0(gstore3) = gstore3, dom remove-refsize0(gstore4) ∩ ginval1 = ∅, elems nx ∩ ginval1 = ∅, dom gstore3 ∪ elems nx = dom gstore4 ∪ ginval1, btree-inv(rp, adr, istore1[m0, indexblock(indx, lax, m3 - m2)], istore2, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), btree-inv(rp, @(m0, m1, m2), istore1, istore1, zh0, ri, ri), btree-inv(rp, adr, istore3, istore2, zh, ri, fi), btree-inv(rp, adr, istore3[n0, indexblock([], [], 0)], istore2, zh, ri, fi), inv(indexblock(indx, lax, m3)), inv(istore1), inv(gstore4 \ ginval1), inv(gstore3), inv(istore3), inv(istore2), inv(istore3[n0, indexblock([], [], 0)]), inv(istore1[m0, indexblock(indx, lax, m3 - m2)]), rp ∈ zh, m0 ∈ istore1, m2 ≤ m3, istore2 ⊑ istore1[m0, indexblock(indx, lax, m3 - m2)], istore3[n0, indexblock([], [], 0)] ⊑ istore1, istore2 ⊑ istore3, istore2 ⊑ istore3[n0, indexblock([], [], 0)], istore2 ⊑ istore1, ⌊err⌋ ⊦ dups(nx), n0 ∈ istore3, ∃ ri0, fi0. btree-inv(rp, adr, istore1[m0, indexblock(indx, lax, m3 - m2)], istore2, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri0, fi0)

Proof step 139 from proof inv-commit (previous step)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

Additional information