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: |
|---|---|---|---|
| del-lists-unions | proved | all subs proved | ex-p, ex, del-list-rec, del-list-base, |
| ex-p | proved | all subs proved | ex, |
| del-lists-1 | proved | all subs proved | ex, del-list-base, del-list-rec, |
| del-list-rec | axiom | ||
| del-list-base | axiom | ||
| ex | axiom |