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: |
|---|---|---|---|
| inv-get-page-size | proved | all subs proved | get-page-size, |
| inv-get-leb-size | proved | all subs proved | get-leb-size, |
| inv-sync-device | proved | all subs proved | sync-device, |
| inv-recover | proved | all subs proved | recover, |
| inv-get-volume-size | proved | all subs proved | get-volume-size, |
| inv-write | proved | all subs proved | write, |
| inv-read | proved | all subs proved | read, |
| inv-change | proved | all subs proved | change, |
| inv-remap | proved | all subs proved | unmap, remap, |
| inv-unmap | proved | all subs proved | unmap, |
| inv-format | proved | all subs proved | format, |
| get-page-size | axiom | ||
| get-leb-size | axiom | ||
| sync-device | axiom | ||
| recover | axiom | ||
| get-volume-size | axiom | ||
| write | axiom | ||
| read | axiom | ||
| change | axiom | ||
| remap | axiom | ||
| unmap | axiom | ||
| format | axiom |