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: |
|---|---|---|---|
| sel-embed-fin | proved | all subs proved | inj-rqui, sel-rqui-dotl, elim-finp-ant, |
| sel-embed-inf | proved | all subs proved | inj-rqui0, sel-rqui0-dotf, elim-finp-suc, |
| elim-finp-suc | proved | all subs proved | inj-rqui0, test-finp-rqui, gen-stream, test-finp-rqui0, |
| elim-finp-ant | proved | all subs proved | test-finp-rqui0, inj-rqui, gen-stream, test-finp-rqui, |
| sel-rqui0-dotf | axiom | ||
| inj-rqui0 | axiom | ||
| test-finp-rqui | axiom | ||
| gen-stream | axiom | ||
| test-finp-rqui0 | axiom | ||
| sel-rqui-dotl | axiom | ||
| inj-rqui | axiom |