[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 linked-tree

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:
tr-unfold	proved	all subs proved	tr-rec, tr-base, tr-fold,
tr-fold	proved	all subs proved	tr-rec,
tr-fold-t	proved	all subs proved	tr-rec,
tr-branch	proved	all subs proved	tr-base,
tr-fold-singleton	proved	all subs proved	tr-base, tr-rec,
tr-null	proved	all subs proved	tr-rec, tr-base,
tr-base	axiom
tr-rec	axiom