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: |
|---|---|---|---|
| insert-nonempty | proved | all subs proved | count-empty, count-insert, extension, |
| insert-inj | proved | all subs proved | count-insert, extension, |
| ext-rec | proved | all subs proved | extension, count-insert, |
| count-same | proved | all subs proved | count-insert, |
| count-other | proved | all subs proved | count-insert, |
| count-1 | proved | all subs proved | count-empty, count-insert, |
| bag-add2-eq-elim | proved | all subs proved | count-insert, extension, |
| count-empty | axiom | ||
| extension | axiom | ||
| count-insert | axiom |