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

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-5-2provedall subs proved finout, finroot, beh-def,
finrootprovedall subs proved times-in,
finoutprovedall subs proved times-in,
times-inprovedall subs proved times-ins, times-null,
lemma_2-5-1provedall subs proved beh-def,
times-nullaxiom
times-insaxiom
beh-defaxiom