[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 restricted

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:
lemma_2-2-3bprovedall subs proved after, forest,
lemma_2-2-3aprovedall subs proved after, forest,
lemma_2-2-2provedall subs proved lemma_2-2-2-aux, after, finiteinvisiblenondet,
lemma_2-2-1provedall subs proved after, deterministic,
forestaxiom
finiteinvisiblenondetaxiom
lemma_2-2-2-auxprovedall subs proved
deterministicaxiom
afteraxiom