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: |
|---|---|---|---|
| in-evict-other | proved | all subs proved | evict-rec-dentry, evict-rec-same, evict-rec-other, evict-rec-inode, evict-base, |
| at-truncate-other | proved | all subs proved | at-truncate, |
| at-truncate-lower | proved | all subs proved | at-truncate, |
| at-evict-other | proved | all subs proved | evict-rec-dentry, evict-rec-same, evict-rec-inode, evict-rec-other, evict-base, |
| at-truncate | axiom | ||
| evict-base | axiom | ||
| evict-rec-other | axiom | ||
| evict-rec-inode | axiom | ||
| evict-rec-same | axiom | ||
| evict-rec-dentry | axiom |