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

zbrar[n] = mkzentry(key, adr), zbrar[n0] = mkzentry(key0, adr0), n0 < # zbrar, nused < # zbrar, n < # zbrar, sorted(zbrar, 0, nused + 1), n0 ≤ nused, n ≤ nused ⊦ key0 = key, ∃ n1. n1 < nused ∧ (n1 < n ⊃ zbrar[n1];zbrar[n1 + 1]).entry? ∧ (n1 < n ⊃ zbrar[n1];zbrar[n1 + 1]).key = key0

User applied rule cut formula

And obtained the following new goals

Proof step 62:
zbrar[n0] = mkzentry(key0, adr0), zbrar[n] = mkzentry(key, adr), n < # zbrar, nused < # zbrar, n0 < # zbrar, n0 < n, sorted(zbrar, 0, nused + 1), n ≤ nused, n0 ≤ nused ⊦ key0 = key, ∃ n1. n1 < nused ∧ (n1 < n ⊃ zbrar[n1];zbrar[n1 + 1]).entry? ∧ (n1 < n ⊃ zbrar[n1];zbrar[n1 + 1]).key = key0
Proof step 64:
zbrar[n0] = mkzentry(key0, adr0), zbrar[n] = mkzentry(key, adr), n < # zbrar, nused < # zbrar, n0 < # zbrar, sorted(zbrar, 0, nused + 1), n ≤ nused, n0 ≤ nused ⊦ key0 = key, n0 < n, ∃ n1. n1 < nused ∧ (n1 < n ⊃ zbrar[n1];zbrar[n1 + 1]).entry? ∧ (n1 < n ⊃ zbrar[n1];zbrar[n1 + 1]).key = key0

Rule argument

fma: n0 < n

Additional information

Used formulas: n0 < n