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

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:
booleanarray-getprovedall subs proved boolvals-get, getbooleanarray, getbooleanarray-def,
booleanarray-lenprovedall subs proved boolvals-length, getbooleanarray, getbooleanarray-def,
booleanarray-putprovedall subs proved boolvals-put, getbooleanarray, getbooleanarray-def,
getbooleanarray-lengthprovedall subs proved boolvals-length, getbooleanarray, getbooleanarray-def,
boolvals-getprovedall subs proved booleanvalues-rec, booleanvalues-empty,
boolvals-putprovedall subs proved booleanvalues-rec, booleanvalues-empty,
boolvals-lengthprovedall subs proved booleanvalues-rec, booleanvalues-empty,
issorted-emptyprovedall subs proved issorted-le-all-def,
issorted-le-all-defaxiom
booleanvalues-emptyaxiom
booleanvalues-recaxiom
getbooleanarray-defaxiom
getbooleanarrayaxiom