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: |
|---|---|---|---|
| px-to-parent | proved | all subs proved | px-app, px-parent, |
| pw-px-parent-prefix | proved | all subs proved | px-prefix, px-parent-noneps, pw, |
| pr-px-parent-prefix | proved | all subs proved | px-prefix, px-parent-noneps, pr, |
| px-app | proved | all subs proved | px, |
| px-parent-noneps | proved | all subs proved | px-parent, |
| px-prefix | proved | all subs proved | px, |
| py-px | proved | all subs proved | py, |
| py-pw | proved | all subs proved | pw, py, |
| px-to-eps | proved | all subs proved | px, |
| px-parent-last | proved | all subs proved | px-parent, |
| px-parent-eps | proved | all subs proved | px-parent, |
| px-eps | proved | all subs proved | px, |
| py | axiom | ||
| px-parent | axiom | ||
| px | axiom | ||
| pw | axiom | ||
| pr | axiom |