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: |
|---|---|---|---|
| infguess-has-same-traces | proved | all subs proved | infguess-refines, |
| infguess-refines | proved | all subs proved | infguess-forward-refines, |
| infguess-forward-refines | proved | all subs proved | infguess-forward-refines-aux, |
| infguess-forward-refines-aux | proved | all subs proved |