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

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:
dls-split	proved	all subs proved	dls-emp, dls-one, dls-rec,
dls-last	proved	all subs proved	dls-rec, dls-one, dls-emp,
dls-one	proved	all subs proved	dls-emp, dls-rec,
dls-length	proved	all subs proved	dls-rec, dls-emp,
dls-emp	axiom
dls-rec	axiom