[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 encoding-lpt

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:
lptlebs-zeroprovedall subs proved lptsize-zero, lpt-lebs,
encoding-uniqueprovedall subs proved encoding-unique-h, is-encoded-full,
lptsize-zeroprovedall subs proved lpt-size,
encoding-unique-hprovedall subs proved lpt-size, is-encoded,
lptsize-ge-minprovedall subs proved lpt-size,
lptlebs-lptsizeprovedall subs proved lpt-size, lpt-lebs,
encoding-shiftprovedall subs proved lpt-size, is-encoded,
lpt-lebsaxiom
is-encoded-fullaxiom
is-encodedaxiom
lpt-sizeaxiom