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

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:
pop-corr	proved	all subs proved	mod-twice, tolist-ext-one, tolist-at, tolist-size, abs,
head-corr	proved	all subs proved	tolist-ext-one, at-first-mod, abs,
tolist-ext-one	proved	all subs proved	tolist-at,
push-corr	proved	all subs proved	tolist-at, tolist-rec-inv, tolist-size, abs,
tolist-at	proved	all subs proved	tolist-size, tolist-rec-inv, tolist-base,
tolist-size	proved	all subs proved	tolist-rec-inv, tolist-base,
at-first-mod	proved	all subs proved	at-n-mod,
tolist-rec-inv	proved	all subs proved	tolist-rec,
create-corr	proved	all subs proved	tolist-base, abs,
clear-corr	proved	all subs proved	tolist-base, abs,
tolist-rec	axiom
mod-twice	proved	all subs proved
abs	axiom
tolist-base	axiom
at-n-mod	proved	all subs proved