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: |
|---|---|---|---|
| max-right | proved | all subs proved | max-def, |
| min-right | proved | all subs proved | min-def, |
| min-left | proved | all subs proved | min-def, |
| max-left | proved | all subs proved | max-def, |
| min-def | axiom | ||
| max-def | axiom |