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: |
|---|---|---|---|
| uniquelen | proved | all subs proved | app, nuni-01, nuni, ex, inone, unique-r, inapp, empty, unique-e, |
| firstoc | proved | all subs proved | inkeys-n, inone, inapp, empty, |
| lenequal | proved | all subs proved | app, nuni-01, nuni, inkeys-n, ex, inone, unique-r, inapp, |
| unique-01 | proved | all subs proved | inone, unique-r, inapp, empty, unique, |
| unique-04 | proved | all subs proved | nuni-01, nuni, |
| inkeys-nc | proved | all subs proved | inkeys-n, |
| unique-03 | proved | all subs proved | nuni-01, nuni, |
| in-put | proved | all subs proved | put-yes, inkeys-n, put-no, inapp, inone, put-empty, empty, |
| unique | proved | all subs proved | unique-r, inone, inapp, unique-e, one, |
| inkeys-n | proved | all subs proved | incons, inrec, |
| nuni | proved | all subs proved | inone, unique-r, inapp, empty, nuni-01, |
| infirst | proved | all subs proved | inrec, |
| inrec | proved | all subs proved | inone, inapp, |
| incons | proved | all subs proved | inapp, |
| app | proved | all subs proved | inapp, unique-r, not, |
| one | proved | all subs proved | unique-e, empty, unique-r, |
| nuni-01 | proved | all subs proved | not, unique-r, |
| unique-02 | proved | all subs proved | in-01, unique-r, |
| in-02 | proved | all subs proved | inone, inapp, |
| insfirst | proved | all subs proved | put-no, inone, inapp, put-yes, |
| insnotin | proved | all subs proved | put-no, inone, inapp, put-empty, |
| in | proved | all subs proved | in-01, unique-r, |
| lenle | proved | all subs proved | ex, empty, unique-e, inone, unique-r, inapp, |
| in-03 | proved | all subs proved | inapp, |
| ex | proved | all subs proved | inassoc, |
| in-01 | proved | all subs proved | inassoc, |
| not | proved | all subs proved | unique-r, |
| empty | proved | all subs proved | inassoc, |
| inapp | proved | all subs proved | inassoc, |
| inone | proved | all subs proved | inassoc, |
| put-one | proved | all subs proved | put-yes, |
| k-unique-r | proved | all subs proved | unique-r, unique-e, |
| one-01 | proved | all subs proved | assoc-yes, |
| assoc-yes | axiom | ||
| put-empty | axiom | ||
| put-no | axiom | ||
| inassoc | axiom | ||
| unique-e | axiom | ||
| put-yes | axiom | ||
| unique-r | axiom |