[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 linked-tree-list

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:
toList-ordered-tree-orderedprovedall subs proved elem-le-tree-unfold, in-tree-in-toList, tree-le-elem-unfold, ordered-rec, toList-rec, ordered-base, toList-base,
tree-le-elem-unfoldprovedall subs proved in-rec, tree-le-elem-rec, tree-le-elem-base, tree-le-elem-in-tree,
elem-le-tree-unfoldprovedall subs proved in-rec, elem-le-tree-rec, elem-le-tree-base, elem-le-tree-in-tree,
ordered-toList-orderedprovedall subs proved in-tree-in-toList, elem-le-tree-in-tree, tree-le-elem-toList-last, toList-rec, ordered-rec, toList-base, ordered-base,
tree-toList-size-equal-less-2provedall subs proved size-toList, equal-or-one-diff,
tree-le-elem-in-treeprovedall subs proved in-rec, tree-le-elem-rec, in-base, tree-le-elem-base,
size-toListprovedall subs proved toList-rec, toList-base,
tree-le-elem-toList-lastprovedall subs proved toList-base, tree-le-elem-base, toList-rec, tree-le-elem-rec,
elem-le-tree-in-treeprovedall subs proved in-rec, elem-le-tree-rec, in-base, elem-le-tree-base,
in-tree-in-toListprovedall subs proved in-rec, toList-rec, toList-base, in-base,
equal-or-one-diffaxiom
elem-le-tree-baseaxiom
elem-le-tree-recaxiom
in-baseaxiom
in-recaxiom
tree-le-elem-recaxiom
tree-le-elem-baseaxiom
toList-baseaxiom
ordered-baseaxiom
toList-recaxiom
ordered-recaxiom