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: |
|---|---|---|---|
| set-val-nxt | proved | all subs proved | upd-tim-dotnxt, upd-tim-dotval, gen-cell, |
| gen-cell | axiom | ||
| upd-tim-dotval | axiom | ||
| upd-tim-dotnxt | axiom |