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: |
|---|---|---|---|
| termination | proved | all subs proved | soundness, |
| completeness | proved | all subs proved | completeness-rec, soundness-rec, build-rec, build, |
| soundness | proved | all subs proved | build-rec, soundness-rec, build, |
| completeness-rec | proved | all subs proved | soundness-rec, build-rec, |
| soundness-rec | proved | all subs proved | build-rec, |
| harness-2 | proved | all subs proved | build-rec, build, |
| harness-1 | proved | all subs proved | build-rec, build, |
| build | axiom | ||
| build-rec | axiom |