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: |
|---|---|---|---|
| nodes-alloc-subseteq | proved | all subs proved | nodes-at-alloc, at-nodes, in-nodes, |
| nodes-at-alloc | proved | all subs proved | at-nodes, |
| prefix-subseteq-dom-nodes-rev | proved | all subs proved | in-nodes, |
| prefix-imp-nodes-subset | proved | all subs proved | at-nodes, in-nodes, |
| prefix-imp-dom-nodes-subset | proved | all subs proved | in-nodes, |
| notin-add-diff-dom-nodes | proved | all subs proved | in-nodes, |
| nodes-write-refsize | proved | all subs proved | at-nodes, in-nodes, |
| nodes-empty | proved | all subs proved | in-nodes, |
| nodes-append | proved | all subs proved | at-nodes, in-nodes, |
| nodes-alloc-append | proved | all subs proved | at-nodes, in-nodes, |
| nodes-alloc | proved | all subs proved | at-nodes, in-nodes, |
| insert-inter-notin-dom-nodes | proved | all subs proved | in-nodes, |
| at-nodes | axiom | ||
| in-nodes | axiom |