[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-fixed-size-nonempty

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-not-garbage-nonempty	proved	all subs proved	is-encoded-unique, is-garbage-nonempty,
is-encoded-unique	proved	all subs proved	is-encoded-nonempty,
is-encoded-size	proved	all subs proved	is-encoded-nonempty,
is-encoded-not-garbage	proved	all subs proved	is-encoded-nonempty,
encode-contract	proved	all subs proved	is-encoded-nonempty, encode,
decode-contract	proved	all subs proved	is-encoded-nonempty, decode,
is-garbage-nonempty	axiom
encode	axiom
decode	axiom
is-encoded-nonempty	axiom