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: |
|---|---|---|---|
| unwind-BSRA-theorem | proved | all subs proved | xlrf-intro, BSP_BSRA-def, xlrf-property, |
| xlrf-property | proved | all subs proved | xosc-intro, xlrf-intro, |
| xosc-intro | proved | all subs proved | |
| BSP_BSRA-def | axiom | ||
| xlrf-intro | proved | all subs proved |