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: |
|---|---|---|---|
| INVR-step | proved | all subs proved | INV-def, INVR-def, |
| INVR-nextlevel | proved | all subs proved | INV-def, INVR-def, |
| INVR-init | proved | all subs proved | INVR-def, |
| INV-step | proved | all subs proved | INV-def, |
| INV-nextlevel | proved | all subs proved | INV-def, |
| INV-init | proved | all subs proved | INV-def, |
| INVR-def | axiom | ||
| INV-def | axiom |