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: |
|---|---|---|---|
| content-enq | proved | all subs proved | content-rec, content-base, content-one, |
| content-one | proved | all subs proved | content-base, content-rec, |
| abspc-equal | proved | all subs proved | abspc-def, |
| content-modtid | proved | all subs proved | content-rec, content-base, |
| content-modnotin | proved | all subs proved | content-rec, content-base, |
| content-base | axiom | ||
| content-rec | axiom | ||
| abspc-def | axiom |