[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 string-append

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:
restprovedall subs proved app, rest-01,
injectivityprovedall subs proved one,
rest-01provedall subs proved app, append-rec,
oneprovedall subs proved chartostring-01,
firstprovedall subs proved first-01,
assocprovedall subs proved append-rec, app, append-base,
chartostring-01provedall subs proved append-base, append-rec, chartostring,
first-01provedall subs proved append-rec,
appprovedall subs proved append-rec, append-base,
rest-oneprovedall subs proved chartostring,
recprovedall subs proved append-base, append-rec, chartostring,
one-01provedall subs proved chartostring,
first-oneprovedall subs proved chartostring,
empty-01provedall subs proved append-rec,
emptyprovedall subs proved append-rec, append-base,
chartostringaxiom
append-baseaxiom
append-recaxiom