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

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:
hexbyte-byteprovedall subs proved hex-empty, numhex-rec, hexbyte,
numhex-recprovedall subs proved hex-rec,
test-01provedall subs proved hexchar5, hex-empty, hexchar1, hexcharF, hexchar9, hex-rec,
hex-recprovedall subs proved hexstring-length, hexint-rec, hexstring-rec-01, hex-def,
hexstring-lengthprovedall subs proved hexstring-rec-01, hexstring-empty,
hex-emptyprovedall subs proved hexint-empty, hexstring-empty, hex-def,
hexstring-rec-01provedall subs proved hexstring-rec,
hexchar9axiom
hexcharFaxiom
hexchar1axiom
hexchar5axiom
hexstring-recaxiom
hexbyteaxiom
hexint-recaxiom
hex-defaxiom
hexstring-emptyaxiom
hexint-emptyaxiom