[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 partial-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:
violations-swapprovedall subs proved less-same, less-rec, violations-rec, violations-exists,
violations-existsprovedall subs proved less-rec, violations-rec,
less-sameprovedall subs proved less-rec,
sorted-sorted-next-1-leprovedall subs proved partial-sorted,
sorted-sorted-next-0-leprovedall subs proved partial-sorted,
sorted-orderedprovedall subs proved partial-sorted,
sorted-next-1-swapprovedall subs proved partial-sorted,
sorted-next-1provedall subs proved partial-sorted,
sorted-next-0-swapprovedall subs proved partial-sorted,
sorted-next-0provedall subs proved partial-sorted,
sorted-1provedall subs proved partial-sorted,
sorted-0provedall subs proved partial-sorted,
violations-recaxiom
partial-sortedaxiom
less-recaxiom