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

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:
nnn	proved	all subs proved	irreflexivity, transitivity, loc,
nll	proved	all subs proved	irreflexivity, transitivity, loc,
nen	proved	all subs proved	irreflexivity, transitivity, loc,
lel	proved	all subs proved	irreflexivity, transitivity, loc,
loc	proved	all subs proved	irreflexivity, transitivity, seq,
seq	proved	all subs proved	sls,
sls	proved	all subs proved	ls-le, irreflexivity, transitivity, totality,
ls-le	proved	all subs proved	irreflexivity, transitivity,
totality	axiom
transitivity	axiom
irreflexivity	axiom