[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 list-as-arrayinstance

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:
elim-addprovedall subs proved get-succ, get-zero, size-add,
case-listprovedall subs proved get-succ, get-zero, size-add,
get-succprovedall subs proved size-add,
put-zeroprovedall subs proved size-add,
Uniform-listprovedall subs proved size-add,
size-addprovedall subs proved
get-zeroprovedall subs proved