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: |
|---|---|---|---|
| wbuf-cons-nbytes-ls-pagesize | proved | all subs proved | wbuf-cons, |
| wbuf-cons-nbytes-le-pagesize | proved | all subs proved | wbuf-cons, |
| wbuf-cons-nbytes-aligned | proved | all subs proved | wbuf-cons, |
| wbuf-cons-mapped | proved | all subs proved | wbuf-cons, |
| wbuf-cons | axiom |