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: |
|---|---|---|---|
| dot-assoc | proved | all subs proved | sum-swap, dist, at-dot, cols-dot, rows-dot, |
| sum-swap | proved | all subs proved | sum-split, sum-rec, sum-empty, sum-base, |
| sum-empty | proved | all subs proved | sum-rec, sum-base, |
| sum-split | proved | all subs proved | sum-rec, sum-base, |
| dist | proved | all subs proved | sum-rec, sum-base, |
| rows-dot | axiom | ||
| cols-dot | axiom | ||
| at-dot | axiom | ||
| sum-base | axiom | ||
| sum-rec | axiom |