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: |
|---|---|---|---|
| Hashset-refines-Set | proved | all subs proved | Hashset-fwsim-Set, |
| Hashset-fwsim-Set | proved | all subs proved | HashsetIOA-def, abs-is-fwsim, |
| abs-is-fwsim | proved | all subs proved | ext-RetMember, ext-RetInsert, ext-InvMember, ext-InvInsert, ext-DoMember, ext-DoInsert, ext-tau, HashsetIOA-def, |
| HashsetIOA-def | axiom | ||
| ext-tau | axiom | ||
| ext-DoInsert | axiom | ||
| ext-DoMember | axiom | ||
| ext-InvInsert | axiom | ||
| ext-InvMember | axiom | ||
| ext-RetInsert | axiom | ||
| ext-RetMember | axiom |