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: |
|---|---|---|---|
| disjpred-04 | proved | all subs proved | disjpred-06, |
| disjpred-02 | proved | all subs proved | disjpred-05, |
| disjpred-01 | proved | all subs proved | disjpred-03, |
| disjpred-06 | proved | all subs proved | test-07, test-01, test-03, test-05, gen, |
| disjpred-05 | proved | all subs proved | test-06, test-04, test-08, test-02, gen, |
| disjpred-03 | proved | all subs proved | test-06, test-04, test-05, test-02, gen, |
| inodekey-id | proved | all subs proved | elim-01, |
| elim-01 | axiom | ||
| test-03 | axiom | ||
| test-01 | axiom | ||
| test-07 | axiom | ||
| test-08 | axiom | ||
| gen | axiom | ||
| test-02 | axiom | ||
| test-05 | axiom | ||
| test-04 | axiom | ||
| test-06 | axiom |