[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 data-refinement

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:
refine-delete-min	proved	all subs proved	set-min, set-butmin, set-leaf,
set-butmin	proved	all subs proved	set-min, in-set,
refine-insert	proved	all subs proved	set-insert,
set-insert	proved	all subs proved	in-set,
set-leaf	proved	all subs proved	in-set,
set-min	proved	all subs proved	in-set,
set-branch	proved	all subs proved	in-set,
in-set	axiom