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

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:
pos-atprovedall subs proved s2l-length, s2l-one, s2l-app,
inject-s2lprovedall subs proved s2l-rec, s2l-empty-01, s2l-empty,
s2l-lengthprovedall subs proved s2l-one, s2l-app, s2l-empty,
s2l-empty-01provedall subs proved s2l-one, s2l-app, s2l-empty,
s2l-oneprovedall subs proved s2l-empty, s2l-rec-01,
string2stringprovedall subs proved l2s-one, l2s-app, s2l-rec, l2s-empty, s2l-empty,
sortedchars-no-dupsprovedall subs proved s2l-empty, s2l-rec-01, s2l-app,
l2s-lengthprovedall subs proved l2s-one, l2s-app, l2s-empty,
s2l-rec-01provedall subs proved s2l-rec,
s2l-appprovedall subs proved s2l-rec, s2l-empty,
l2s-appprovedall subs proved l2s-rec, l2s-empty,
l2s-oneprovedall subs proved l2s-empty, l2s-rec,
l2s-emptyaxiom
l2s-recaxiom
s2l-emptyaxiom
s2l-recaxiom