[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 partition-refinement-test

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:
MAIN-exampleprovedall subs proved NEWPARTS-example, REFINE-example,
REFINE-exampleprovedall subs proved At-other-strong, in-insert-strong,
NEWPARTS-exampleprovedall subs proved updF-get-strong, At-other-strong, in-insert-strong,
in-insert-strongprovedall subs proved
At-other-strongprovedall subs proved
updF-get-strongprovedall subs proved