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: |
|---|---|---|---|
| Security | proved | all subs proved | lemma1, RMA-1, test, |
| lemma1 | proved | all subs proved | eqd-reflexivity, lemma1-gen, execl, |
| eqd-reflexivity | proved | all subs proved | eqd-def, |
| lemma1-gen | proved | all subs proved | alter-observe-respects-policy, RMA-3, policy-respects-observe, RMA-2-weaker, eqd-def, purge-rec, run-rec, purge-base, run-base, |
| eqd-transitivity | proved | all subs proved | eqd-def, |
| eqd-symmetry | proved | all subs proved | eqd-def, |
| run-base | axiom | ||
| purge-base | axiom | ||
| run-rec | axiom | ||
| purge-rec | axiom | ||
| RMA-2-weaker | axiom | ||
| policy-respects-observe | axiom | ||
| RMA-3 | axiom | ||
| alter-observe-respects-policy | axiom | ||
| execl | axiom | ||
| eqd-def | axiom | ||
| test | axiom | ||
| RMA-1 | axiom |