[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 26 from proof btree-ri-unique (previous step)

# zbrar0 = BRANCH_SIZE, # asar = # asar0, adr ∈ as0 ↔ adr ∈ as1, adr ∈ as1 ↔ ¬ dirty1, union(asar, 0, # asar0) = as1 -- adr, union(asar0, 0, # asar0) = alladrs1 -- adr, (( rp0 => mkznode(rp, zbrar0, false, dirty1, # asar0) * bnode(rp0, zbrar0, 0, # asar0, # asar0, height0 + 1, dirty1, ri0, iast, as0 -- adr, alladrs0 -- adr) * P0) )(zh), (( ( (λ n. ⌜zbrar0[n].branch?⌝ ∧ btree(rp0, zbrar0[n].child, zbrar0[n].adr, height0, dirty1, key-range(zbrar0, n, # asar0, ri1), iast, asar[n], asar0[n], ok) )⊗_ (0, # asar0 ) * rp0 => mkznode(rp, zbrar0, false, dirty1, # asar0)) * P1) )(zh), # asar0 < BRANCH_SIZE, disj(asar, 0, # asar0), disj(asar0, 0, # asar0), sorted(zbrar0, 0, # asar0 - 1), unmodified(adr, mkznode(rp, zbrar0, false, dirty1, # asar0), iast), adr ∈ alladrs1, adr ∈ alladrs0, as1 ⊆ dom iast, as1 ⊆ alladrs1, as0 ⊆ dom iast, as0 ⊆ alladrs0, dirty1 → dirty, ∀ rp, rp0, adr, dirty, ri0, iast, as0, alladrs0, P0, zh, ri1, as1, alladrs1, P1. ((btree(rp, rp0, adr, height0, dirty, ri0, iast, as0, alladrs0, ok) * P0))(zh) ∧ ((btree(rp, rp0, adr, height0, dirty, ri1, iast, as1, alladrs1, ok) * P1))(zh) ∧ as0 ⊆ alladrs0 ∧ as0 ⊆ dom iast ∧ as1 ⊆ alladrs1 ∧ as1 ⊆ dom iast → ri0 = ri1 ∨ rp0 = null ⊦ # alladrs0 = 0, # alladrs1 = 0, # asar0 = 0, alladrs0 = ∅, alladrs1 = ∅, ri0 = ri1

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 27:
# asar = # asar0, # zbrar0 = BRANCH_SIZE, # asar0 = m + 1, adr ∈ as1 ↔ ¬ dirty1, adr ∈ as0 ↔ adr ∈ as1, union(asar0, 0, # asar0) = alladrs1 -- adr, union(asar, 0, # asar0) = as1 -- adr, (( ( (λ n. ⌜zbrar0[n].branch?⌝ ∧ btree(rp0, zbrar0[n].child, zbrar0[n].adr, height0, dirty1, key-range(zbrar0, n, # asar0, ri1), iast, asar[n], asar0[n], ok) )⊗_ (0, # asar0 ) * rp0 => mkznode(rp, zbrar0, false, dirty1, # asar0)) * P1) )(zh), (( rp0 => mkznode(rp, zbrar0, false, dirty1, # asar0) * bnode(rp0, zbrar0, 0, # asar0, # asar0, height0 + 1, dirty1, ri0, iast, as0 -- adr, alladrs0 -- adr) * P0) )(zh), # asar0 < BRANCH_SIZE, disj(asar0, 0, # asar0), disj(asar, 0, # asar0), sorted(zbrar0, 0, m), unmodified(adr, mkznode(rp, zbrar0, false, dirty1, # asar0), iast), adr ∈ alladrs0, adr ∈ alladrs1, as0 ⊆ alladrs0, as0 ⊆ dom iast, as1 ⊆ alladrs1, as1 ⊆ dom iast, dirty1 → dirty, ∀ rp, rp0, adr, dirty, ri0, iast, as0, alladrs0, P0, zh, ri1, as1, alladrs1, P1. ((btree(rp, rp0, adr, height0, dirty, ri0, iast, as0, alladrs0, ok) * P0))(zh) ∧ ((btree(rp, rp0, adr, height0, dirty, ri1, iast, as1, alladrs1, ok) * P1))(zh) ∧ as0 ⊆ alladrs0 ∧ as0 ⊆ dom iast ∧ as1 ⊆ alladrs1 ∧ as1 ⊆ dom iast → ri0 = ri1 ∨ rp0 = null ⊦ # asar0 = 0, # alladrs1 = 0, # alladrs0 = 0, alladrs0 = ∅, alladrs1 = ∅, ri0 = ri1

Rule argument

spec: nat name: elim-pred-c seq: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1 subst: [n, m] → [# asar0, m]

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # asar0, m