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: |
|---|---|---|---|
| stream-inf-forward | proved | all subs proved | inj-01, test-01, test-02, gen, |
| stream-fin-forward | proved | all subs proved | inj-02, ex, |
| sel-embed-inf | proved | all subs proved | inj-01, sel-01, test-02, disj, gen, |
| sel-embed-fin | proved | all subs proved | elim, |
| test-01 | axiom | ||
| ex | axiom | ||
| inj-02 | axiom | ||
| gen | axiom | ||
| disj | axiom | ||
| test-02 | axiom | ||
| sel-01 | axiom | ||
| inj-01 | axiom | ||
| elim | axiom |