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: |
|---|---|---|---|
| IFProperty2 | proved | all subs proved | User-interference-def-02, domains-interference-def-02, |
| IFProperty1 | proved | all subs proved | User-interference-def-01, domains-interference-def-01, |
| domains-interference-def-02 | axiom | ||
| User-interference-def-02 | axiom | ||
| domains-interference-def-01 | axiom | ||
| User-interference-def-01 | axiom |