[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 IOrefine-conds-imply-IOrefine

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:
bw-leqstar	proved	all subs proved	bwinv-leqstar, bwtrueinv,
imfiniobackwardinv-implies-leqrefine	proved	all subs proved	imfiniobackwardinv-implies-leqrefine-aux,
normedfw-branchingfw	proved	all subs proved	normedfw-branchingfw-aux,
simpleforward-is-leqrefine	proved	all subs proved	simpleforward-is-forward, forward-implies-leqrefine,
forward-implies-leqrefine	proved	all subs proved	forward-lem,
simpleforward-is-forward	proved	all subs proved	simpleforward-is-forward-aux,
normedfw-branchingfw-aux	proved	all subs proved	triang-fin,
imfiniobackwardinv-implies-leqrefine-aux	proved	all subs proved	bwinv-leqstar,
bwtrueinv	proved	all subs proved	bwtrueinv-aux,
branchinfw-fw	proved	all subs proved	branchinfw-fw-aux,
branchingfw-normedfw	proved	all subs proved	branchingfw-normedfw-aux,
branchingfw-normedfw-aux	proved	all subs proved
branchinfw-fw-aux	proved	all subs proved
simpleforward-is-forward-aux	proved	all subs proved
forward-lem	proved	all subs proved
triang-fin	proved	all subs proved
bwtrueinv-aux	proved	all subs proved
bwinv-leqstar	proved	all subs proved