[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 23 from proof payload-shift-left (previous step)

zbrar[n] = mkzentry(key, adr), zbrar[n0] = mkzentry(key0, adr0), n0 + 1 < # zbrar, n0 < n, n0 < # zbrar, n < # zbrar, nused < # zbrar, n0 < nused, sorted(zbrar, 0, nused + 1), key0 ∈ payload(shl(zbrar, n, nused + 1), 0, nused), n ≤ nused, ∀ n1. n1 < n0 ∧ zbrar[n1].entry? → zbrar[n1].key ≠ key0 ⊦ payload(shl(zbrar, n, nused + 1), 0, nused)[key0] = adr0, key0 = key

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 24:
m + nused ≤ # zbrar, n < nused, zbrar[m + n] = mkzentry(key, adr), ∀ n0. n0 < n ∧ zbrar[m + n0].entry? → zbrar[m + n0].key ≠ key ⊦ payload(zbrar, m, nused)[key] = adr
Proof step 25:
zbrar[n0] = mkzentry(key0, adr0), zbrar[n] = mkzentry(key, adr), n0 < nused, nused < # zbrar, n < # zbrar, n0 < # zbrar, n0 < n, n0 + 1 < # zbrar, sorted(zbrar, 0, nused + 1), key0 ∈ payload(shl(zbrar, n, nused + 1), 0, nused), n ≤ nused, ∀ n1. n1 < n0 ∧ zbrar[n1].entry? → zbrar[n1].key ≠ key0 ⊦ payload(shl(zbrar, n, nused + 1), 0, nused)[key0] = adr0, key0 = key, 0 + nused ≤ # shl(zbrar, n, nused + 1) ∧ n0 < nused ∧ shl(zbrar, n, nused + 1)[0 + n0] = mkzentry(key0, adr0) ∧ (∀ n1. n1 < n0 ∧ shl(zbrar, n, nused + 1)[0 + n1].entry? → shl(zbrar, n, nused + 1)[0 + n1].key ≠ key0)

Rule argument

spec: <toplevel> name: at-payload seq: m + nused ≤ # zbrar, n < nused, zbrar[m + n] = mkzentry(key, adr), ∀ n0. n0 < n ∧ zbrar[m + n0].entry? → zbrar[m + n0].key ≠ key ⊦ payload(zbrar, m, nused)[key] = adr subst: [n, adr, key, nused, m, zbrar] → [n0, adr0, key0, nused, 0, shl(zbrar, n, nused + 1)] flags: <all paths>

Additional information

Used terms: n0, adr0, key0, nused, 0, shl(zbrar, n, nused + 1)