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: |
|---|---|---|---|
| infinite-append-prefixnextnli | proved | all subs proved | nextnli-lemma, |
| infinite-append-prefixnextli-weak | proved | all subs proved | nextli-lemma, |
| infinite-append-prefixnextli | proved | all subs proved | nextli-lemma, |
| nextnli-lemma | proved | all subs proved | |
| nextli-lemma | proved | all subs proved |