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: |
|---|---|---|---|
| Del-rec-other | proved | all subs proved | read-notin, |
| Del-rec-same | proved | all subs proved | read-notin, |
| Del-empty | proved | all subs proved | read-notin, |
| read-notin | proved | all subs proved |