This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.
| Name: | Sequent: | Type: |
|---|---|---|
| 2exp-size | ⊦ 2exp-size(m) ↔ (∃ n. m = 2^ n) | An Axiom |
| no-dups | ⊦ no-dups(kar, n) ↔ (∀ m0, m1. m0 < # kar ∧ m0 < n ∧ m1 < # kar ∧ m1 < n ∧ m0 ≠ m1 → kar[m0] ≠ kar[m1]) | An Axiom |
| keyset-rec | ⊦ n < # kar → keyset(kar, n + 1) = keyset(kar, n) ++ kar[n] | An Axiom |
| keyset-base | ⊦ keyset(kar, 0) = ∅ | An Axiom |
| heap-order | ⊦ heap-order(kar, n) ↔ (∀ m. m < n ∧ m ≠ 0 → ¬ kar[m].key < kar[(m - 1) / 2].key) | An Axiom |
| no-dups-idx | ⊦ no-dups-idx(kar, n) ↔ (∀ m0, m1. m0 < # kar ∧ m0 < n ∧ m1 < # kar ∧ m1 < n ∧ m0 ≠ m1 → kar[m0].idx ≠ kar[m1].idx) | An Axiom |
| valid-idx | ⊦ valid-idx(kar, ar, n) ↔ n ≤ # kar ∧ (∀ m. m < n → kar[m].idx < # ar ∧ ar[kar[m].idx].idx = m) | An Axiom |
| 2exp-size-0 | ⊦ ¬ 2exp-size(0) | A User Theorem |
| 2exp-size-1 | ⊦ 2exp-size(1) | A User Theorem |
| 2exp-size-mult2 | ⊦ 2exp-size(2 * n) ↔ 2exp-size(n) | A User Theorem |
| heap-order-0 | ⊦ heap-order(kar, 0) | A User Theorem |
| heap-order-1 | ⊦ heap-order(kar, 1) | A User Theorem |
| heap-order-add-parent-key | n + 1 ≤ # kar, n ≠ 0 ⊦ heap-order(kar, n) ∧ kar[(n - 1) / 2] = key-index(key, m) → heap-order(kar[n, key-index(key, m)], n + 1) | A User Theorem |
| heap-order-add-smaller | n + 1 ≤ # kar, n ≠ 0 ⊦ heap-order(kar, n) ∧ ¬ ki.key < kar[(n - 1) / 2].key → heap-order(kar[n, ki], n + 1) | A User Theorem |
| heap-order-min | ⊦ n ≠ 0 ∧ n ≤ # kar ∧ heap-order(kar, n) ∧ m < n ∧ m ≠ 0 → ¬ kar[m].key < kar[0].key | A User Theorem |
| heap-order-overwrite-children-at | n ≤ # kar, m < n ⊦ heap-order(kar, n) ∧ (m ≠ 0 → ¬ ki.key < kar[(m - 1) / 2].key) ∧ (2 * m + 1 < n → ¬ kar[2 * m + 1].key < ki.key) ∧ (2 * m + 2 < n → ¬ kar[2 * m + 2].key < ki.key) → (¬ heap-order(kar[m, ki], n) ↔ false) | A User Theorem |
| heap-order-overwrite-children-ok | n ≤ # kar, m < n ⊦ heap-order(kar, n) ∧ ¬ ki.key < kar[m].key ∧ (2 * m + 1 < n → ¬ kar[2 * m + 1].key < ki.key) ∧ (2 * m + 2 < n → ¬ kar[2 * m + 2].key < ki.key) → (¬ heap-order(kar[m, ki], n) ↔ false) | A User Theorem |
| heap-order-overwrite-parent-ok | n ≤ # kar, m < n, m ≠ 0 ⊦ heap-order(kar, n) ∧ ¬ kar[m].key < ki.key ∧ ¬ ki.key < kar[(m - 1) / 2].key → heap-order(kar[m, ki], n) | A User Theorem |
| heap-order-overwrite0 | n ≤ # kar, n ≠ 0 ⊦ heap-order(kar, n) ∧ ¬ kar[0].key < ki.key → heap-order(kar[0, ki], n) | A User Theorem |
| heap-order-pull-down-parent | ⊦ heap-order(kar, n) ∧ m < n ∧ m ≠ 0 ∧ n ≤ # kar ∧ kar[(m - 1) / 2] = ki → heap-order(kar[m, ki], n) | A User Theorem |
| heap-order-pull-up-child | n ≤ # kar, m < n ⊦ heap-order(kar, n) ∧ 2 * m + 1 < n ∧ ki = (2 * m + 2 < n ∧ kar[2 * m + 2].key < kar[2 * m + 1].key ⊃ kar[2 * m + 2];kar[2 * m + 1]) → (¬ heap-order(kar[m, ki], n) ↔ false) | A User Theorem |
| heap-order-remove-last | n < # kar ⊦ heap-order(kar, n + 1) → heap-order(kar, n) | A User Theorem |
| key-index-in-keyset-array-extract | ⊦ ar[m] = elemindex(a, m0) ∧ valid-idx(kar, ar, n) ∧ key-index(key, m) ∈ keyset(kar, n) → kar[m0] = key-index(key, m) | A User Theorem |
| key-set-1 | # kar ≠ 0 ⊦ keyset(kar, 1) = ∅ ++ kar[0] | A User Theorem |
| key-set-extract-index | n ≤ # kar ⊦ ki ∈ keyset(kar, n) ↔ (∃ m. m < n ∧ ki = kar[m]) | A User Theorem |
| key-set-write-last | m < # kar ⊦ keyset(kar[m, ki], m + 1) = keyset(kar, m) ++ ki | A User Theorem |
| key-set-write-nodups | n < m, m ≤ # kar ⊦ no-dups-idx(kar, m) → keyset(kar[n, ki], m) = (keyset(kar, m) -- kar[n]) ++ ki | A User Theorem |
| key-set-write-other | m ≤ n, n < # kar ⊦ keyset(kar[n, ki], m) = keyset(kar, m) | A User Theorem |
| keyset-overwrite-add | m ≤ # kar ⊦ n < m → keyset(kar[n, ki], m) ++ kar[n] = keyset(kar, m) ++ ki | A User Theorem |
| keyset-size-bound | m < # kar ⊦ # keyset(kar, m) ≤ m | A User Theorem |
| keyset-size-bound0 | m < # kar ⊦ # keyset(kar, m) = m + 1 ↔ false | A User Theorem |
| keyset-subarray-eq | m ≤ # kar0, m ≤ # kar1 ⊦ subarray(kar0, 0, m) = subarray(kar1, 0, m) → keyset(kar0, m) = keyset(kar1, m) | A User Theorem |
| keyset-subarray-eq-add | m ≤ # kar0, m ≤ # kar1 ⊦ subarray(kar0, 0, m) = subarray(kar1, 0, m) ∧ ¬ ki0 ∈ keyset(kar0, m) → (keyset(kar0, m) ++ ki0 = keyset(kar1, m) ++ ki1 ↔ ki0 = ki1) | A User Theorem |
| keyset-xchg | m ≤ # kar ⊦ n0 < m ∧ n1 < m ∧ kar[n0] = ki1 ∧ kar[n1] = ki0 → keyset(kar[n0, ki0][n1, ki1], m) = keyset(kar, m) | A User Theorem |
| no-dups-0 | ⊦ no-dups(kar, 0) | A User Theorem |
| no-dups-idx-0 | ⊦ no-dups-idx(kar, 0) | A User Theorem |
| no-dups-idx-mvlast | ⊦ m < # kar ∧ no-dups-idx(kar, m + 1) ∧ kar[m] = ki → no-dups-idx(kar[m0, ki], m) | A User Theorem |
| no-dups-idx-rec | ⊦ n < # kar ∧ no-dups-idx(kar, n) → (no-dups-idx(kar[n, ki], n + 1) ↔ ¬(∃ ki0. ki0 ∈ keyset(kar, n) ∧ ki0.idx = ki.idx)) | A User Theorem |
| no-dups-idx-rem1 | ⊦ no-dups-idx(kar, n + 1) → no-dups-idx(kar, n) | A User Theorem |
| no-dups-idx-remlast | ⊦ m < # kar ∧ no-dups-idx(kar, m + 1) ∧ kar[m] = ki → no-dups-idx(kar[0, ki], m) | A User Theorem |
| no-dups-idx-xchg | ⊦ no-dups-idx(kar, n) ∧ kar[m0] = ki0 ∧ kar[m1] = ki1 ∧ m0 < n ∧ m1 < n ∧ m0 < # kar ∧ m1 < # kar → no-dups-idx(kar[m0, ki1][m1, ki0], n) | A User Theorem |
| no-dups-keyset-size | ⊦ m ≤ # kar → (no-dups(kar, m) ↔ # keyset(kar, m) = m) | A User Theorem |
| no-dups-keyset-size-simp | m ≤ # kar ⊦ no-dups(kar, m) → # keyset(kar, m) = m | A User Theorem |
| no-dups-shorter | ⊦ no-dups(kar, m + 1) → no-dups(kar, m) | A User Theorem |
| no-dups-update-key | ⊦ no-dups-idx(kar, m) ∧ kar[m1] = key-index(key0, m0) → no-dups-idx(kar[m1, key-index(key, m0)], m) | A User Theorem |
| valid-idx-0 | ⊦ valid-idx(kar, ar, 0) | A User Theorem |
| valid-idx-imp-1 | ⊦ valid-idx(kar, ar, n + 1) → valid-idx(kar, ar, n) | A User Theorem |
| valid-idx-last-valid | m < m0 ⊦ kar[m] = key-index(key, n) ∧ valid-idx(kar, ar, m0) → ¬ # ar ≤ n | A User Theorem |
| valid-idx-move-last | ⊦ m < # kar ∧ valid-idx(kar, ar, m + 1) ∧ kar[m] = key-index(key, m1) → valid-idx(kar[m0, key-index(key, m1)], ar[m1, ar[m1].idx:= m0], m) | A User Theorem |
| valid-idx-outofbounds | m ≤ m1 ⊦ valid-idx(kar, ar, m + 1) ∧ ar[m0] = elemindex(a, m1) → ¬ key-index(key, m0) ∈ keyset(kar, m) | A User Theorem |
| valid-idx-rec | ⊦ n < # kar ∧ m < # ar ∧ valid-idx(kar, ar, n) ∧ no-dups-idx(kar[n, key-index(key, m)], n + 1) → (¬ valid-idx(kar[n, key-index(key, m)], ar[m, ar[m].idx:= n], n + 1) ↔ false) | A User Theorem |
| valid-idx-remlast | ⊦ valid-idx(kar, ar, m + 1) ∧ kar[m] = key-index(key, n) → valid-idx(kar[0, key-index(key, n)], ar[n, ar[n].idx:= 0], m) | A User Theorem |
| valid-idx-update-key | ⊦ valid-idx(kar, ar, n) ∧ kar[m] = key-index(key0, m0) → valid-idx(kar[m, key-index(key, m0)], ar, n) | A User Theorem |
| valid-idx-xhg | ⊦ valid-idx(kar, ar, n) ∧ m0 < n ∧ m1 < n ∧ kar[m0] = key-index(key1, n1) ∧ kar[m1] = key-index(key0, n0) → valid-idx(kar[m0, key-index(key0, n0)][m1, key-index(key1, n1)], ar[n0, ar[n0].idx:= m0][n1, ar[n0, ar0[n0].idx:= m0][n1].idx:= m1], n) | A User Theorem |