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: |
|---|---|---|---|
| restrict-le2 | proved | all subs proved | at-le-lt, at-le, in-le, |
| at-le-lt | proved | all subs proved | at-le, |
| restrict-norm | proved | all subs proved | at-le, at-gt, in-le, in-gt, |
| restrict-le4 | proved | all subs proved | at-le, in-le, |
| restrict-le3 | proved | all subs proved | at-le, in-le, |
| restrict-le1 | proved | all subs proved | at-le, in-le, |
| restrict-gt4 | proved | all subs proved | at-gt, in-gt, |
| restrict-gt3 | proved | all subs proved | at-gt, in-gt, |
| restrict-gt2 | proved | all subs proved | at-gt, in-gt, |
| restrict-gt1 | proved | all subs proved | at-gt, in-gt, |
| put-le | proved | all subs proved | at-le, in-le, |
| put-gt | proved | all subs proved | at-gt, in-gt, |
| le-emp | proved | all subs proved | in-le, |
| gt-emp | proved | all subs proved | in-gt, |
| drop-le | proved | all subs proved | at-le, in-le, |
| drop-gt | proved | all subs proved | at-gt, in-gt, |
| deln-le | proved | all subs proved | at-le, in-le, |
| deln-gt | proved | all subs proved | at-gt, in-gt, |
| del-le | proved | all subs proved | at-le, in-le, |
| del-gt | proved | all subs proved | at-gt, in-gt, |
| in-le | axiom | ||
| in-gt | axiom | ||
| at-gt | axiom | ||
| at-le | axiom |