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: |
|---|---|---|---|
| modify+-sym | proved | modify-sym, modify+, | |
| modify-sym | invalid | all subs proved | modify+, modify, |
| modify-footprint | proved | all subs proved | modify+, footprint, |
| modify-agree | invalid | all subs proved | modify, agree, modify+, |
| footprint | axiom | ||
| agree | axiom | ||
| modify | axiom | ||
| modify+ | axiom |