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: |
|---|---|---|---|
| arr2list-get | proved | all subs proved | arr2list-len, arr2list-rec, arr2list-base, |
| arr2list-put | proved | all subs proved | arr2list-mod-high, arr2list-len, arr2list-rec, arr2list-base, |
| arr2list-mod-high | proved | all subs proved | arr2list-rec, arr2list-base, |
| arr2list-len | proved | all subs proved | arr2list-rec, arr2list-base, |
| arr2list-base | axiom | ||
| arr2list-rec | axiom |