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: |
|---|---|---|---|
| not-garbage-valid-imp-empty | proved | all subs proved | test-03, disj-02, disj-03, gen, test-01, |
| test-01 | axiom | ||
| gen | axiom | ||
| disj-03 | axiom | ||
| disj-02 | axiom | ||
| test-03 | axiom |