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: |
|---|---|---|---|
| perm-swap | proved | all subs proved | numoc-swap, perm-def, |
| numoc-swap | proved | all subs proved | numoc-swap-gen, |
| numoc-swap-gen | proved | all subs proved | nonzero-numoc, numoc-rec, numoc-base, |
| nonzero-numoc | proved | all subs proved | numoc-rec, numoc-base, |
| perm-trans | proved | all subs proved | perm-def, |
| perm-refl | proved | all subs proved | perm-def, |
| perm-def | axiom | ||
| numoc-base | axiom | ||
| numoc-rec | axiom |