[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 42 from proof btree-istore-reduce-refed (previous step)

# zbrar = BRANCH_SIZE, # asar = m + 1, # asar0 = m + 1, adr ∈ as ↔ ¬ dirty0, union(asar, 0, m + 1) = as -- adr, union(asar0, 0, m + 1) = alladrs -- adr, (( ( (λ n. ⌜zbrar[n].branch?⌝ ∧ btree(r, zbrar[n].child, zbrar[n].adr, height0, dirty0, key-range(zbrar, n, m + 1, ri), iast0, asar[n], asar0[n], ok) )⊗_ (0, m + 1 ) * r => mkznode(rp, zbrar, false, dirty0, m + 1)) * P) )(zh0), m < BRANCH_SIZE, disj(asar, 0, m + 1), disj(asar0, 0, m + 1), nsize(m + 1, nstat), sorted(zbrar, 0, m), unmodified(adr, mkznode(rp, zbrar, false, dirty0, m + 1), iast0), adr ∈ alladrs, as ⊆ alladrs, as ⊆ dom iast0, iast0 | as ⊆ iast1, dirty0 → dirty, (rp0 = null ⊃ adr ∈ as ∧ P(zh);r = rp0 ∧ zh0 = zh), ∀ rp, rp0, adr, dirty, ri, iast0, as, alladrs, nstat, P, zh, iast1. ((btree(rp, rp0, adr, height0, dirty, ri, iast0, as, alladrs, nstat) * P))(zh) ∧ iast0 | as ⊆ iast1 ∧ as ⊆ dom iast0 ∧ as ⊆ alladrs → ((btree(rp, rp0, adr, height0, dirty, ri, iast1, as, alladrs, nstat) * P))(zh) ⊦ # alladrs = 0, alladrs = ∅, # asar = m + 1 ∧ disj(asar, 0, m + 1) ∧ union(asar, 0, m + 1) = as -- adr ∧ (∃ asar2. # asar2 = m + 1 ∧ disj(asar2, 0, m + 1) ∧ union(asar2, 0, m + 1) = alladrs -- adr ∧ (( ( (λ n. ⌜zbrar[n].branch?⌝ ∧ btree(r, zbrar[n].child, zbrar[n].adr, height0, dirty0, key-range(zbrar, n, m + 1, ri), iast1, asar[n], asar2[n], ok) )⊗_ (0, m + 1 ) * r => mkznode(rp, zbrar, false, dirty0, m + 1)) * P) )(zh0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information