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: |
|---|---|---|---|
| normedfw-branchingfw | proved | all subs proved | normedfw-branchingfw-aux, |
| normedfw-branchingfw-aux | proved | all subs proved | triang-fin, |
| branchingfw-normedfw | proved | all subs proved | branchingfw-normedfw-aux, |
| branchinfw-fw | proved | all subs proved | branchinfw-fw-aux, |
| triang-fin | proved | all subs proved | |
| branchingfw-normedfw-aux | proved | all subs proved | |
| branchinfw-fw-aux | proved | all subs proved |