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-eq-0 | proved | all subs proved | max-second-le, max, |
| max-second-le | proved | all subs proved | max, |
| min-same | proved | all subs proved | min, |
| min-notls2 | proved | all subs proved | min, |
| min-notls1 | proved | all subs proved | min, |
| min-not-ls-add | proved | all subs proved | min, |
| min-ls1-right | proved | all subs proved | min, |
| min-ls-right | proved | all subs proved | min, |
| min-ls-add | proved | all subs proved | min, |
| min-le-leftn | proved | all subs proved | min, |
| min-le-left | proved | all subs proved | min, |
| min-l-and-r | proved | all subs proved | min, |
| min-comm | proved | all subs proved | min, |
| min-add-same | proved | all subs proved | min, |
| min-add-l-and-r | proved | all subs proved | min, |
| min-add | proved | all subs proved | min, |
| min-0-right | proved | all subs proved | min, |
| min-0-left | proved | all subs proved | min, |
| max-second-ls | proved | all subs proved | max, |
| max-same | proved | all subs proved | max, |
| max-notls2 | proved | all subs proved | max, |
| max-notls1 | proved | all subs proved | max, |
| max-le2 | proved | all subs proved | max, |
| max-le1 | proved | all subs proved | max, |
| max-first-ls | proved | all subs proved | max, |
| max-first-le | proved | all subs proved | max, |
| max-comm | proved | all subs proved | max, |
| max-add | proved | all subs proved | max, |
| max-0-right | proved | all subs proved | max, |
| max-0-left | proved | all subs proved | max, |
| min | axiom | ||
| max | axiom |