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: |
|---|---|---|---|
| two_way_sort-corr-term | proved | all subs proved | swap-decl, two_way_sort-decl, |
| two_way_sort-decl | axiom | ||
| swap-decl | axiom |