[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 66 from proof prepost-update (previous step)

kar[m4 + 1] = key-index(key4, m6), kar[m4 / 2] = key-index(key5, m7), kar[m3 / 2] = key-index(key0, m2), kar[m3 + 1] = key-index(key1, m), ar[m] = elemindex(a, m3 + 1), kar[m3 + 1, key-index(key0, m2)][m4 + 1] = key-index(key2, m1), 2exp-size(# kar), m4 + 1 < # kar, m3 + 1 < # kar, key < key0, key < key1, m3 + 1 < m0, m4 + 1 < m0, key2 < key5, no-dups-idx(kar, m0), valid-idx(kar, ar, m0), key-index(key1, m) ∈ keyset(kar, m0), m0 ≤ # kar, ∀ m. m < m0 ∧ m ≠ 0 → ¬ kar[m].key < kar[(m - 1) / 2].key ⊦ # keyset(kar, m0) = 0, m4 / 2 = m3 + 1, keyset(kar, m0) = ∅, key4 < key5

Heuristic weak cut applied rule cut formula

And closed the goal!

Rule argument

fma: m4 + 1 = m3 + 1

Additional information

Used simplifier rules: ⊦ m ≠ n → kar[n, ki][m] = kar[m]; (s)% ⊦ m + n = m + n0 ↔ n = n0; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ key-index(key, m) = key-index(key0, m0) ↔ key = key0 ∧ m = m0; (ws)% ⊦ m < # kar → kar[m, ki][m] = ki; (s)% ⊦ m / 2 ≠ m + 1; (s)%lel: ⊦ key < key0 ∧ key = key1 → key1 < key0; (forward) from specification oelem[binheap-key]%transitivity: ⊦ key < key0 ∧ key0 < key1 → key < key1; (forward) from specification oelem[binheap-key]%nen: ⊦ ¬ key < key0 ∧ key0 = key1 → ¬ key < key1; (forward) from specification oelem[binheap-key]% ⊦ ¬ key < key; (s) Used formulas: m4 + 1 = m3 + 1