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: |
|---|---|---|---|
| zeropage-eq-fill | proved | all subs proved | page-size, zeropage, |
| emptypage-size | proved | all subs proved | zeropage, |
| emptypage-at | proved | all subs proved | zeropage, |
| page-size | axiom | ||
| zeropage | axiom |