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-2-3b | proved | all subs proved | after, forest, |
| lemma_2-2-3a | proved | all subs proved | after, forest, |
| lemma_2-2-2 | proved | all subs proved | lemma_2-2-2-aux, after, finiteinvisiblenondet, |
| lemma_2-2-1 | proved | all subs proved | after, deterministic, |
| forest | axiom | ||
| finiteinvisiblenondet | axiom | ||
| lemma_2-2-2-aux | proved | all subs proved | |
| deterministic | axiom | ||
| after | axiom |