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

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:
n2s-length-10provedall subs proved n2s-length-09, n2s-length-01, n2s-length, n2s-rec,
n2s-length-09provedall subs proved n2s-length-08, n2s-length-01, n2s-length, n2s-rec,
n2s-length-08provedall subs proved n2s-length-07, n2s-length-01, n2s-length, n2s-rec,
n2s-length-07provedall subs proved n2s-length-06, n2s-length-01, n2s-length, n2s-rec,
n2s-length-06provedall subs proved n2s-length-05, n2s-length-01, n2s-length, n2s-rec,
n2s-length-05provedall subs proved n2s-length-04, n2s-length-01, n2s-length, n2s-rec,
n2s-length-04provedall subs proved n2s-length-03, n2s-length-01, n2s-length, n2s-rec,
n2s-length-03provedall subs proved n2s-length-02, n2s-length-01, n2s-length, n2s-rec,
n2s-length-02provedall subs proved n2s-length, n2s-length-01, n2s-rec,
test-02provedall subs proved charn5, charn4, charn3, charn2, charn1, s2n-num,
s2n-rec-lastprovedall subs proved s2n-app,
n2s-zeroprovedall subs proved n2s-empty, n2s-length-01, n2s-char, n2s-rec, char0,
n2s-s2n-identityprovedall subs proved s2n-char, n2s-length-01, n2s-empty, s2n-app, n2s-rec, n2s-char,
inject-n2sprovedall subs proved n2s-empty, n2s-length-01, n2s-rec, n2s-char,
s2n-numprovedall subs proved s2n-rec-01,
charn1provedall subs proved s2n-char-01,
charn2provedall subs proved s2n-char-01,
charn3provedall subs proved s2n-char-01,
charn4provedall subs proved s2n-char-01,
charn5provedall subs proved s2n-char-01,
s2n-appprovedall subs proved s2n-rec-01,
n2s-length-01provedall subs proved n2s-length,
test-01provedall subs proved char5, char4, char3, char2, char1, n2s-rec,
charn9provedall subs proved s2n-char-01,
charn8provedall subs proved s2n-char-01,
charn7provedall subs proved s2n-char-01,
charn6provedall subs proved s2n-char-01,
charn0provedall subs proved s2n-char-01,
char1provedall subs proved n2s-char,
char2provedall subs proved n2s-char,
char3provedall subs proved n2s-char,
char4provedall subs proved n2s-char,
char5provedall subs proved n2s-char,
s2n-rec-01provedall subs proved s2n-rec,
char0provedall subs proved n2s-char,
n2s-lengthprovedall subs proved n2s-char,
n2s-emptyprovedall subs proved n2s-rec, n2s-char,
s2n-char-01provedall subs proved s2n-char,
n2s-charsprovedall subs proved n2s-char, n2s-rec,
char9provedall subs proved n2s-char,
char8provedall subs proved n2s-char,
char7provedall subs proved n2s-char,
char6provedall subs proved n2s-char,
s2n-recaxiom
s2n-charaxiom
n2s-recaxiom
n2s-charaxiom