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-rows | proved | all subs proved | selrow-get, selrow-size, |
| extension-cols | proved | all subs proved | selcol-get, selcol-size, |
| selcol-size | axiom | ||
| selcol-get | axiom | ||
| selrow-size | axiom | ||
| selrow-get | axiom |