[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 array-revin

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:
rev-revprovedall subs proved rev-at, rev-size,
rev-atprovedall subs proved rev-at-h, rev,
rev-sizeprovedall subs proved rev-size-h, rev,
rev-at-hprovedall subs proved rev-size-h, rev-rec, rev-base,
rev-size-hprovedall subs proved rev-rec, rev-base,
in-atprovedall subs proved in,
rev-baseaxiom
rev-recaxiom
inaxiom
revaxiom