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: |
|---|---|---|---|
| ebm-cons-is-aligned-fill | proved | all subs proved | ebm-cons-aligned, |
| abs-leb-eq-mapped | proved | all subs proved | abs-leb-erased, abs-leb-unmapped, abs-leb-mapped, |
| ebm-cons-aligned | proved | all subs proved | |
| abs-leb-mapped | axiom | ||
| abs-leb-unmapped | axiom | ||
| abs-leb-erased | axiom |