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

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:
LanguageBasedNIF-run	proved	all subs proved	eqlb-equiv-eqd, eqlbs-equiv-eqds,
eqlbs-equiv-eqds	proved	all subs proved	eqlb-equiv-eqd, eqlbs-def,
eqlb-equiv-eqd	proved	all subs proved	observe-all-names, no-read-up, eqlb-def,
no-write-down-follows	proved	all subs proved	observe-all-names,
obs-implies-lbnif	proved	all subs proved	observe-all-names,
eqd-implies-lbnif	proved	all subs proved	observe-all-names,
eqlbs-def	axiom
eqlb-def	axiom
no-read-up	axiom
observe-all-names	axiom