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: |
|---|---|---|---|
| lemma_2-5-2 | proved | all subs proved | finout, finroot, beh-def, |
| finroot | proved | all subs proved | times-in, |
| finout | proved | all subs proved | times-in, |
| times-in | proved | all subs proved | times-ins, times-null, |
| lemma_2-5-1 | proved | all subs proved | beh-def, |
| times-null | axiom | ||
| times-ins | axiom | ||
| beh-def | axiom |