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-9-4 | proved | all subs proved | lemma-2-8-3, |
| lemma_2-9-3 | proved | all subs proved | lemma-2-8-3, |
| lemma-2-8-4 | proved | all subs proved | behcan-traceprop, lemma-2-8-2, lemma-2-8-3, |
| lemma-2-8-3 | proved | all subs proved | lemma-2-8-2, behcan-limitclosed, behcan-traceprop, |
| lemma_2-9-3-fwsim | proved | all subs proved | lemma_2-9-3-fwsim-aux, |
| lemma_2-9-2 | proved | all subs proved | lemma-2-8-2, |
| lemma_2-9-3-fwsim-aux | proved | all subs proved | |
| behcan-traceprop | proved | all subs proved | |
| behcan-limitclosed | proved | all subs proved | |
| lemma-2-8-2 | proved | all subs proved |