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: |
|---|---|---|---|
| value-01 | proved | all subs proved | value, val-other-ap, |
| value | proved | all subs proved | val-K, val-other-ap, |
| value-04 | proved | all subs proved | val-other-ap, |
| value-03 | proved | all subs proved | val-other-ap, |
| value-02 | proved | all subs proved | val-other-ap, |
| val-other-ap | axiom | ||
| val-K | axiom |