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: |
|---|---|---|---|
| to-vtbl-update-vol | proved | all subs proved | to-vtbl-at, to-vtbl-in, to-vtbl-rec, |
| to-vtbl-update | proved | all subs proved | to-vtbl-at, to-vtbl-in, to-vtbl-rec, |
| to-vtbl-size | proved | all subs proved | to-vtbl-base, to-vtbl-in, to-vtbl-rec, |
| to-vtbl-at | proved | all subs proved | to-vtbl-rec, to-vtbl-base, |
| to-vtbl-in | proved | all subs proved | to-vtbl-rec, to-vtbl-base, |
| to-vtbl-base | axiom | ||
| to-vtbl-rec | axiom |