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: |
|---|---|---|---|
| other-DurQLInv | axiom | init-state-inv, step-ACrash, definedness-invDeq-ADoDeq, | |
| DurQInv-thm | axiom | init-state-inv, step-ACrash, definedness-invDeq-ADoDeq, | |
| step-DurQLInv | axiom | init-state-inv, step-ACrash, definedness-invDeq-ADoDeq, | |
| definedness-invDeq-ADoDeq | proved | all subs proved | |
| step-ACrash | proved | all subs proved | |
| init-state-inv | proved | all subs proved |