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

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:
sorted-sub-mergeprovedall subs proved sorted-sub,
sorted-sub-less1provedall subs proved sorted-sub,
sorted-sub-entireprovedall subs proved sorted-sub, sorted-entire,
sorted-sub-change-aboveprovedall subs proved sorted-sub,
sorted-last2provedall subs proved sorted-sub,
sorted-exchangeprovedall subs proved sorted-sub,
sorted-1provedall subs proved sorted-sub,
sorted-0provedall subs proved sorted-sub,
sorted-entireaxiom
sorted-subaxiom