[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 wbuf-abs

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:
abs-size2	proved	all subs proved	abs-def,
abs-size1	proved	all subs proved	abs-def,
abs-size0	proved	all subs proved	abs-def,
abs-nobuffer	proved	all subs proved	abs-def,
abs-mapped-is-mapped-rev	proved	all subs proved	abs-buf-leb-def, abs-def,
abs-mapped-is-mapped	proved	all subs proved	abs-buf-leb-unmapped, abs-def,
abs-buf-leb-def	axiom
abs-def	axiom
abs-buf-leb-unmapped	axiom