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: |
|---|---|---|---|
| precise-mapornull | proved | all subs proved | precise-mapex, mapex, mapornull, |
| map-put | proved | all subs proved | mapex, map-putex, |
| mapex-put-rw | proved | all subs proved | map-putex, mapex, mapex-in, |
| mapex-in | proved | all subs proved | mapex, |
| map-putex | proved | all subs proved | mapex, |
| precise-mapex | proved | all subs proved | mapex, |
| mapex-and | proved | all subs proved | mapex, |
| mapornull-emp | proved | all subs proved | mapornull, |
| mapex-put | proved | all subs proved | mapex, |
| mapornull-ex | proved | all subs proved | mapex, mapornull, |
| mapex-elim | proved | all subs proved | mapex, |
| mapex-del | proved | all subs proved | mapex, |
| mapex-null | proved | all subs proved | mapex, |
| mapornull | axiom | ||
| mapex | axiom |