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: |
|---|---|---|---|
| psortcol-correct | proved | all subs proved | col2cons-eq-getone, ordered-addone-colcons, colcons-getzero, colcons-size, restn-one, onerow-colexpand, colone-sizeone, coleq-elemeq, firstn-one, restn-fullcol, psortcol, |
| col2cons-eq-getone | proved | all subs proved | col2cons-getone, |
| colcons-size | proved | all subs proved | onerow-colexpand, |
| col2cons-getone | proved | all subs proved | onerow-colexpand, |
| psortcol | axiom | ||
| restn-fullcol | proved | all subs proved | |
| firstn-one | proved | all subs proved | |
| coleq-elemeq | proved | all subs proved | |
| colone-sizeone | proved | all subs proved | |
| restn-one | proved | all subs proved | |
| colcons-getzero | proved | all subs proved | |
| ordered-addone-colcons | proved | all subs proved | |
| onerow-colexpand | proved | all subs proved |