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: |
|---|---|---|---|
| mtd-cons-peb-size | proved | all subs proved | mtd-valid-peb, mtd-cons, |
| mtd-cons-extract | proved | all subs proved | mtd-valid-peb, mtd-cons, |
| mtd-cons-above-fillcount-empty | proved | all subs proved | mtd-valid-peb, mtd-cons, |
| mtd-cons | axiom | ||
| mtd-valid-peb | axiom |