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: |
|---|---|---|---|
| cut | proved | all subs proved | nil, cons, rest, first, |
| first | axiom | ||
| rest | axiom | ||
| cons | axiom | ||
| nil | axiom |