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-journal-or-index | proved | all subs proved | disj-05, disj-01, test-01, test-09, disj-06, disj-02, test-03, disj-03, test-04, test-11, gen, |
| gen | axiom | ||
| test-11 | axiom | ||
| test-04 | axiom | ||
| disj-03 | axiom | ||
| test-03 | axiom | ||
| disj-02 | axiom | ||
| disj-06 | axiom | ||
| test-09 | axiom | ||
| test-01 | axiom | ||
| disj-01 | axiom | ||
| disj-05 | axiom |