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: |
|---|---|---|---|
| encode | proved | all subs proved | is-encoded, is-encoded-rec-unique, is-encoded-rec-append, is-encoded-rec-size, is-encoded-base, encode-vtbl, |
| decode | proved | all subs proved | is-encoded-rec-append, is-encoded-rec, is-encoded-rec-unique, is-encoded-rec-size, is-encoded, is-encoded-base, decode-vtbl, |
| is-encoded-rec-append | proved | all subs proved | is-encoded-rec-unique, is-encoded-rec, is-encoded-base, is-encoded-rec-size, |
| is-encoded-unique | proved | all subs proved | is-encoded-rec-unique, is-encoded-rec-size, is-encoded, |
| is-encoded-rec-unique | proved | all subs proved | is-encoded-rec, is-encoded-base, is-encoded-rec-size, |
| is-encoded-rec-size | proved | all subs proved | is-encoded-rec, is-encoded-base, |
| encode-vtbl | axiom | ||
| decode-vtbl | axiom | ||
| is-encoded-base | axiom | ||
| is-encoded | axiom | ||
| is-encoded-rec | axiom |