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: |
|---|---|---|---|
| extension-dh | proved | all subs proved | sel-dh-get, sel-dh-size, |
| extension-wh | proved | all subs proved | sel-wh-get, sel-wh-size, |
| extension-wd | proved | all subs proved | sel-wd-get, sel-wd-size, |
| sel-wd-size | axiom | ||
| sel-wd-get | axiom | ||
| sel-wh-size | axiom | ||
| sel-wh-get | axiom | ||
| sel-dh-size | axiom | ||
| sel-dh-get | axiom |