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: |
|---|---|---|---|
| lemma_2-4 | proved | all subs proved | prefix-closed-def, traceprop-def, limitclosed-def, finleq-def, leq-def, |
| leq-def | axiom | ||
| finleq-def | axiom | ||
| limitclosed-def | axiom | ||
| traceprop-def | axiom | ||
| prefix-closed-def | axiom |