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: |
|---|---|---|---|
| ext-stream-append-2 | proved | all subs proved | ext-stream-append, ext-stream-list, |
| ext-stream-list | proved | all subs proved | ext-list-def, ext-trace-def, |
| ext-stream-append | proved | all subs proved | ext-trace-def, ext-list-def, |
| ext-trace-empty | proved | all subs proved | ext-trace-def, |
| ext-one | proved | all subs proved | ext-list-def, |
| ext-list-empty | proved | all subs proved | ext-list-def, |
| ext-list-append | proved | all subs proved | ext-list-def, |
| ext-trace-def | axiom | ||
| ext-list-def | axiom |