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: |
|---|---|---|---|
| well-founded | proved | all subs proved | order-def, findepth-nocycle, irreflexive, findepth-def, |
| irreflexive | proved | all subs proved | nocycle-def, order-def, |
| findepth-nocycle | proved | all subs proved | findepth-def, nocycle-def, |
| well-founded-ind | proved | all subs proved | order-def, findepth-def, |
| unique-root | proved | all subs proved | rooted-def, |
| transitive | proved | all subs proved | order-def, |
| rooted-def | axiom | ||
| order-def | axiom | ||
| nocycle-def | axiom | ||
| findepth-def | axiom |