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

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:
sgn-num	proved	all subs proved	sgn-add,
sgn-add	proved	all subs proved	sgn-s,
sgn-lt	proved	all subs proved	sgn-s,
sgn-eq0	proved	all subs proved	sgn-0, sgn-s,
sgn	proved	all subs proved	sgn-0, sgn-s,
sgn-s	axiom
sgn-0	axiom