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: |
|---|---|---|---|
| inv-exec-lem | proved | all subs proved | inv-exec, |
| eqd-trans-lem | proved | all subs proved | eqd-trans, |
| eqd-symm-lem | proved | all subs proved | eqd-symm, |
| inv-exec | axiom | ||
| eqd-trans | axiom | ||
| eqd-symm | axiom |