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-esuccess | proved | all subs proved | esuccess, |
| fail-prepost | proved | all subs proved | ecommit, fail, |
| fail-or-success-prepost | proved | all subs proved | ecommit, fail-or-success, |
| esuccess | proved | all subs proved | class, |
| ecommit | proved | all subs proved | class, |
| euclean | proved | all subs proved | class, |
| erofs | proved | all subs proved | class, |
| enotempty | proved | all subs proved | class, |
| enotdir | proved | all subs proved | class, |
| enospc | proved | all subs proved | class, |
| enomem | proved | all subs proved | class, |
| enoent | proved | all subs proved | class, |
| eisdir | proved | all subs proved | class, |
| eio | proved | all subs proved | class, |
| einval | proved | all subs proved | class, |
| efail | proved | all subs proved | class, |
| eexists | proved | all subs proved | class, |
| ebadfd | proved | all subs proved | class, |
| eaccess | proved | all subs proved | class, |
| fail | axiom | ||
| fail-or-success | axiom | ||
| class | axiom |