[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 64 from proof btree-write-other (previous step)

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

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 65:
# zbrar = BRANCH_SIZE, # asar = m + 1, # asar0 = m + 1, adr0 ∈ as ↔ ¬ dirty0, zbrar[n] = mkzbranch(key, adr1, r1), union(asar, 0, m + 1) = as -- adr0, union(asar0, 0, m + 1) = alladrs -- adr0, ((btree(r0, r1, adr1, height0, dirty0, key-range(zbrar, n, m + 1, ri), iast, asar[n], asar0[n], ok) * P0))(zh0), (( ( (λ n. ⌜zbrar[n].branch?⌝ ∧ btree(r0, zbrar[n].child, zbrar[n].adr, height0, dirty0, key-range(zbrar, n, m + 1, ri), iast, asar[n], asar0[n], ok) )⊗_ (0, m + 1 ) * r0 => mkznode(rp, zbrar, false, dirty0, m + 1)) * P) )(zh0), zbrar[n].branch?, n < BRANCH_SIZE, m < BRANCH_SIZE, disj(asar, 0, m + 1), disj(asar0, 0, m + 1), nsize(m + 1, nstat), sorted(zbrar, 0, m), unmodified(adr0, mkznode(rp, zbrar, false, dirty0, m + 1), iast), adr0 ∈ alladrs, n ≤ m, asar[n] ⊆ asar0[n], asar[n] ⊆ dom iast, dirty0 → dirty, (r = null ⊃ adr0 ∈ as ∧ P(zh);r0 = r ∧ zh0 = zh), ∀ rp, r, adr0, dirty, ri, iast, adr, ind, as, alladrs, nstat, P, zh. ( ((btree(rp, r, adr0, height0, dirty, ri, iast[adr, ind], as, alladrs, nstat) * P))(zh) ↔ ((btree(rp, r, adr0, height0, dirty, ri, iast, as, alladrs, nstat) * P))(zh)) ∨ adr ∈ as ⊦ # alladrs = 0, alladrs = ∅, ((btree(r0, r1, adr1, height0, dirty0, key-range(zbrar, n, m + 1, ri), iast[adr, ind], asar[n], asar0[n], ok) * P0))(zh0), (( ( (λ n. ⌜zbrar[n].branch?⌝ ∧ btree(r0, zbrar[n].child, zbrar[n].adr, height0, dirty0, key-range(zbrar, n, m + 1, ri), iast[adr, ind], asar[n], asar0[n], ok) )⊗_ (0, m + 1 ) * r0 => mkznode(rp, zbrar, false, dirty0, m + 1)) * P) )(zh0), adr ∈ as

Rule argument

spec: zbranch name: elim-01 seq: ⊦ zbr.branch? → ( (key = zbr.key ∧ adr = zbr.adr) ∧ r = zbr.child ↔ zbr = mkzbranch(key, adr, r)) subst: [zbr, key, adr, r] → [zbrar[n], key, adr1, r1]

Additional information

Used simplifier rules: ⊦ zbr.branch? → ( (key = zbr.key ∧ adr = zbr.adr) ∧ r = zbr.child ↔ zbr = mkzbranch(key, adr, r)); (elim) Used terms: zbrar[n], key, adr1, r1