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: |
|---|---|---|---|
| correct | proved | all subs proved | multzero, okspmx-def, main-lemma, toMatrix-rowno, toMatrix-colno, addzero, MULT, |
| main-lemma | proved | all subs proved | toMatrix-colno, toMatrix-rowno, toMatrix-add, |
| multzero | proved | all subs proved | mult-emptymx-ind, init, toMatrix-rowno, toMatrix-colno, |
| mult-emptymx-ind | proved | all subs proved | toMatrix-get, |
| toMatrix-add | proved | all subs proved | toMatrix-get, toMatrix-colno, toMatrix-rowno, |
| addzero | proved | all subs proved | init, |
| toMatrix-get | axiom | ||
| init | axiom | ||
| MULT | axiom | ||
| toMatrix-colno | axiom | ||
| toMatrix-rowno | axiom | ||
| okspmx-def | axiom |