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

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:
is-encoded-uniqueprovedall subs proved is-encoded-rec, is-encoded-empty, is-encoded-base,
is-encoded-pagealignedprovedall subs proved is-encoded-size,
is-encoded-emptypage-appendprovedall subs proved is-encoded-size, is-encoded-emptypage, is-encoded-rec, is-encoded-base,
is-encoded-app-oneprovedall subs proved is-encoded-rec, is-encoded-base, is-encoded-one,
is-encoded-emptyprovedall subs proved is-encoded-rec, is-encoded-base,
is-encoded-sizeprovedall subs proved is-encoded-rec, is-encoded-base,
is-encoded-oneprovedall subs proved is-encoded-base, is-encoded-rec,
is-encoded-emptypage-middleprovedall subs proved is-encoded-emptypage, is-encoded-rec, is-encoded-base,
is-encoded-appprovedall subs proved is-encoded-rec, is-encoded-base,
is-encoded-emptypageprovedall subs proved
is-encoded-baseaxiom
is-encoded-recaxiom