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: |
|---|---|---|---|
| writepage-prepost | proved | all subs proved | mkfile-stream, |
| the-stream | proved | all subs proved | mkfile-stream, |
| readpage-prepost | proved | all subs proved | mkfile-stream, |
| mkfile-stream-reduce | proved | all subs proved | mkfile-stream, |
| mkfile-stream | axiom |