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: |
|---|---|---|---|
| recovery | proved | all subs proved | prepost-restore-log, |
| prepost-restore-log | proved | all subs proved | prepost-remove-nonend-blocks, |
| refine-check-commit | proved | all subs proved | refine-commit, |
| prepost-remove-nonend-blocks | proved | all subs proved | |
| refine-commit | proved | all subs proved |