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: |
|---|---|---|---|
| notinf-fin-sym | proved | all subs proved | inj, gen, disj, |
| notinf-fin | proved | all subs proved | inj, disj, gen, |
| fin-inject-embed | proved | all subs proved | elim, |
| gen | axiom | ||
| disj | axiom | ||
| inj | axiom | ||
| elim | axiom |