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: |
|---|---|---|---|
| RMA-1 | proved | all subs proved | obs-in-domain, obs-other-domain, eqd-def, extensionality, |
| extensionality | axiom | ||
| eqd-def | axiom | ||
| obs-other-domain | axiom | ||
| obs-in-domain | axiom |