[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Lemma dependency for Specification Koenigs-Lemma-gen

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:
KoenigsLemmaprovedall subs proved KoenigsLemma-aux, it-succ, it-zero, allreachable-def, hpal-root, hpal-next,
hpal-rootprovedall subs proved infgraph-def, hpal-reachset-set, allreachable-def, finroot-def,
hpal-reachset-setprovedall subs proved reach-def, reachle-def, finreachle-fin, haspathanylength-def,
finreachle-finprovedall subs proved reachle-def, finreach-fin,
hpal-nextprovedall subs proved haspathanylength-def, hpal-next-aux, finout-def,
hpal-next-auxprovedall subs proved haspathanylength-def, hpal-next-auxh,
finreach-finprovedall subs proved finset-nextfin, reach-def,
hpal-next-auxhprovedall subs proved haspathanylength-def,
finset-nextfinprovedall subs proved finout-def,
KoenigsLemma-auxprovedall subs proved it-succ, it-zero,
finroot-defaxiom
infgraph-defaxiom
haspathanylength-defaxiom
finout-defaxiom
reachle-defaxiom
reach-defaxiom
allreachable-defaxiom
it-zeroaxiom
it-succaxiom