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-8-1-b | proved | all subs proved | frag-det, frag-lem, canonical-def, |
| frag-det | proved | all subs proved | frag-lem, canonical-def, |
| frag-lem | proved | all subs proved | canonical-def, |
| lemma-2-8-1-a | proved | all subs proved | canonical-def, |
| frag-lem-2 | proved | all subs proved | canonical-def, |
| exec-lem | proved | all subs proved | canonical-def, |
| can-is-IOAut | proved | all subs proved | canonical-def, |
| canonical-def | axiom |