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

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

Heuristic if-then-else split applied rule case distinction

And obtained the following new goals

Proof step 117:
zbrar[n0] = mkzentry(key, adr), n0 < # zbrar, nused < # zbrar, n < # zbrar, n0 < nused, n0 + 1 < # zbrar, n0 < n, sorted(zbrar, 0, nused + 1), n ≤ nused ⊦ zbrar[n].entry?, ∃ n1. ¬ nused < n1 ∧ zbrar[n1].entry? ∧ zbrar[n1].key = key
Proof step 119:
zbrar[n0 + 1] = mkzentry(key, adr), n0 < # zbrar, nused < # zbrar, n < # zbrar, n0 < nused, n0 + 1 < # zbrar, sorted(zbrar, 0, nused + 1), n ≤ nused ⊦ zbrar[n].entry?, n0 < n, ∃ n1. ¬ nused < n1 ∧ zbrar[n1].entry? ∧ zbrar[n1].key = key

Rule argument

pos: left 1

Proof step 116 from proof payload-shift-left (previous step)

Heuristic if-then-else split applied rule case distinction

And obtained the following new goals

Rule argument

Additional information