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: |
|---|---|---|---|
| refine-and-cstepdet-implies-forward | proved | all subs proved | refine-and-cstepdet-implies-forward-aux, |
| refine-and-cstepdet-implies-forward-aux | proved | all subs proved | maxfrag-exists, |
| maxfrag-exists | proved | all subs proved | iteratest-rec, iteratest-base, |
| refine-and-adet-implies-forward | proved | all subs proved | refine-and-adet-implies-forward-aux, |
| refine-and-adet-implies-forward-aux | proved | all subs proved | |
| iteratest-base | axiom | ||
| iteratest-rec | axiom |