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: |
|---|---|---|---|
| KoenigsLemma | proved | all subs proved | KoenigsLemma-aux, it-succ, it-zero, allreachable-def, hpal-root, hpal-next, |
| hpal-root | proved | all subs proved | infgraph-def, hpal-reachset-set, allreachable-def, finroot-def, |
| hpal-reachset-set | proved | all subs proved | reach-def, reachle-def, finreachle-fin, haspathanylength-def, |
| finreachle-fin | proved | all subs proved | reachle-def, finreach-fin, |
| hpal-next | proved | all subs proved | haspathanylength-def, hpal-next-aux, finout-def, |
| hpal-next-aux | proved | all subs proved | haspathanylength-def, hpal-next-auxh, |
| finreach-fin | proved | all subs proved | finset-nextfin, reach-def, |
| hpal-next-auxh | proved | all subs proved | haspathanylength-def, |
| finset-nextfin | proved | all subs proved | finout-def, |
| KoenigsLemma-aux | proved | all subs proved | it-succ, it-zero, |
| finroot-def | axiom | ||
| infgraph-def | axiom | ||
| haspathanylength-def | axiom | ||
| finout-def | axiom | ||
| reachle-def | axiom | ||
| reach-def | axiom | ||
| allreachable-def | axiom | ||
| it-zero | axiom | ||
| it-succ | axiom |