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: |
|---|---|---|---|
| lim-unique | proved | all subs proved | mon-lem, prefix-def, |
| lim-exists | proved | all subs proved | mon-def, mon-lem, prefix-def, |
| mon-lem | proved | all subs proved | mon-def, prefix-def, |
| prefix-trans | proved | all subs proved | prefix-def, |
| prefix-def | axiom | ||
| mon-def | axiom |