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: |
|---|---|---|---|
| pfxclosed-exec | proved | all subs proved | pfxclosed-execstar, exec-is-lift-execstar, |
| exec-is-lift-execstar | proved | all subs proved | frag-is-lift-fragstar, |
| pfxclosed-execstar | proved | all subs proved | pfxclosed-fragstar, |
| pfxclosed-frag | proved | all subs proved | pfxclosed-fragstar, frag-is-lift-fragstar, |
| frag-is-lift-fragstar | proved | all subs proved | |
| pfxclosed-fragstar | proved | all subs proved |