[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 caterpillar-refines-tree-buffer

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-addprovedall subs proved prefixn-shorter, prefixn-add,
prefixn-shorterprovedall subs proved prefixn-add,
prefixn-addprovedall subs proved