[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 nat-list-less

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:
ls-prepend-bound-add1	proved	all subs proved	ls-ext,
ls-bound-notin	proved	all subs proved	ls-ext,
ls-add	proved	all subs proved	ls-ext,
ls-ext	proved	all subs proved	ls-rec, ls-base,
ls-base	axiom
ls-rec	axiom