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

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:
BFS-correct-if-reachable	proved	all subs proved	ADD-preserves-INV-INVR, decl-03,
ADD-preserves-INV-INVR	proved	all subs proved	ADD-lemma, ADD-preserves-INV,
BFS-returns-fail-implies-not-reachable	proved	all subs proved	ADD-preserves-INV, decl-03,
ADD-preserves-INV	proved	all subs proved	ADD-lemma,
ADD-lemma	proved	all subs proved	decl-01,
decl-03	axiom
decl-01	axiom