[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 Progress-I-2-Theory

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:
no-progress-right	proved	all subs proved	no-progress-left,
no-progress-left	proved	all subs proved	no-progress-left-aux, stable-fw,
progress-right	proved	all subs proved	progress-left,
no-progress-right-aux	proved	all subs proved	no-progress-left-aux,
progress-left	proved	all subs proved	progress-left-aux, stable-fw, progress-fw,
no-progress-left-aux	proved	all subs proved	stable-fw, no-progress-left-aux0,
progress-right-aux	proved	all subs proved	progress-left-aux,
no-init-violation-right	proved	all subs proved	no-init-violation-left,
progress-left-aux	proved	all subs proved	stable-fw,
no-progress-left-aux0	proved	all subs proved	progress-fw, stable-fw,
no-init-violation-left	proved	all subs proved	progress-fw, stable-fw,
stable-fw	proved	all subs proved	stable-def,
progress-fw	proved	all subs proved	P-restr-def,
no-progress-fw	proved	all subs proved	notP-def, P-restr-def,
stable-def	axiom
P-restr-def	axiom
notP-def	axiom