[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 3 from proof unmodified-sorted-node (previous step)

BRANCH_SIZE = # zbrar, iast[adr] = indexnode(brar, bv1, nused + 1), indexnode(brar, bv1, nused + 1) = save(mkznode(rp, zbrar, bv1, false, nused + 1)), nused < BRANCH_SIZE, adr ∈ iast ⊦ sorted(load(brar, 0, nused + 1), 0, nused) ↔ sorted(zbrar, 0, nused)

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 4:
n + m ≤ # zbrar ⊦ sorted(zbrar, n, m) ↔ (∀ m0, m1. m0 < m1 ∧ m1 < m → zbrar[n + m0].key < zbrar[n + m1].key)
Proof step 5:
BRANCH_SIZE = # zbrar, iast[adr] = indexnode(brar, bv1, nused + 1), indexnode(brar, bv1, nused + 1) = save(mkznode(rp, zbrar, bv1, false, nused + 1)), nused < BRANCH_SIZE, adr ∈ iast, 0 + nused ≤ # load(brar, 0, nused + 1) ⊦ (∀ m0, m1. m0 < m1 ∧ m1 < nused → load(brar, 0, nused + 1)[0 + m0].key < load(brar, 0, nused + 1)[0 + m1].key) ↔ sorted(zbrar, 0, nused)

Rule argument

spec: zbranch-array-sorted name: sorted-all seq: n + m ≤ # zbrar ⊦ sorted(zbrar, n, m) ↔ (∀ m0, m1. m0 < m1 ∧ m1 < m → zbrar[n + m0].key < zbrar[n + m1].key) subst: [m, n, zbrar] → [nused, 0, load(brar, 0, nused + 1)] flags: <all paths>

Additional information

Used simplifier rules: ⊦ n + 0 = n; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ # load(brar, m, nused) = BRANCH_SIZE; (s)% ⊦ m < n → m ≤ n; (s) Used terms: nused, 0, load(brar, 0, nused + 1)