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: |
|---|---|---|---|
| of-cons-notdir | proved | all subs proved | of-cons, |
| of-cons-file | proved | all subs proved | of-cons, |
| min-third | proved | all subs proved | min3, |
| min-second | proved | all subs proved | min3, |
| min-less-third | proved | all subs proved | min3, |
| min-less-second | proved | all subs proved | min3, |
| min-less-first | proved | all subs proved | min3, |
| min-le-diff-third | proved | all subs proved | min3, |
| min-first | proved | all subs proved | min3, |
| min-0 | proved | all subs proved | min3, |
| has-valid-content | proved | all subs proved | valid-content, |
| dir-not-open | proved | all subs proved | is-open, of-cons, |
| min3 | axiom | ||
| valid-content | axiom | ||
| of-cons | axiom | ||
| is-open | axiom |