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: |
|---|---|---|---|
| test | proved | all subs proved | test-06, test-08, test-07, gen, test-01, |
| test-01 | proved | all subs proved | test-08, test-06, test-07, test-05, gen, |
| test-02 | proved | all subs proved | test-06, ex-04, |
| ex-04 | axiom | ||
| test-05 | axiom | ||
| gen | axiom | ||
| test-07 | axiom | ||
| test-08 | axiom | ||
| test-06 | axiom |