A lemma (entry) may depend on lemmas (entries) below its position, but never on lemmas
above its position. This means the list is a topological order of the dependency graph.
An entry 'all subs proved' means that all used lemmas are (transitively) proved.
| Name: | Status: | Subs proved? | Used: |
|---|
| prepost-update | proved | all subs proved
| bubble-down-inv,
prepost-bubble-down,
bubble-up-inv,
prepost-bubble-up,
bin-heap-inv-def,
keyset,
|
| prepost-remove | proved | all subs proved
| bubble-down-inv,
prepost-bubble-down,
bubble-up-inv,
prepost-bubble-up,
bin-heap-inv-def,
keyset,
|
| prepost-insert | proved | all subs proved
| bubble-up-inv,
prepost-bubble-up,
prepost-resize,
keyset,
bin-heap-inv-def,
|
| prepost-extract-min | proved | all subs proved
| bubble-down-inv,
prepost-bubble-down,
prepost-get-min,
bin-heap-inv-def,
keyset,
|
| prepost-resize | proved | all subs proved
| prepost-next2pot,
bin-heap-inv-def,
|
| prepost-bubble-up | proved | all subs proved
| keyset,
bubble-up-inv,
|
| prepost-get-min | proved | all subs proved
| bin-heap-inv-def,
keyset,
|
| prepost-bubble-down | proved | all subs proved
| div2-mult4-add-k,
keyset,
bubble-down-inv,
|
| prepost-empty | proved | all subs proved
| keyset,
bin-heap-inv-def,
|
| keyset-eq-empty | proved | all subs proved
| bin-heap-inv-def,
keyset,
|
| key-set-in | proved | all subs proved
| bin-heap-inv-def,
keyset,
|
| prepost-next2pot | proved | all subs proved
| |
| bubble-up-inv | axiom | | |
| bubble-down-inv | axiom | | |
| div2-mult4-add-k | proved | all subs proved
| |
| keyset | axiom | | |
| bin-heap-inv-def | axiom | | |