[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 string-data

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:
inj-03	proved	all subs proved	empty, elim,
empty	proved	all subs proved	disj,
inj-02	proved	all subs proved	inj,
inj-01	proved	all subs proved	inj,
elim	axiom
inj	axiom
disj	axiom