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: |
|---|---|---|---|
| toar | proved | all subs proved | tostream-at, toar-at, tostream-size, toar-size, finp-ar, |
| finp-ar | proved | all subs proved | toar-disj, |
| toar-disj | proved | all subs proved | tostream-size, |
| tostream-inj | proved | all subs proved | tostream-at, tostream-size, |
| toar-empty | proved | all subs proved | toar-size, |
| from-emptystream | proved | all subs proved | emptystream, |
| at-emptystream | proved | all subs proved | emptystream, |
| ar-empty | proved | all subs proved | tostream-size, |
| toar-size | axiom | ||
| toar-at | axiom | ||
| tostream-at | axiom | ||
| emptystream | axiom | ||
| tostream-size | axiom |