[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 sort-invariants

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:
Inv-main-reduce	proved	all subs proved	Inv-main,
Inv-main-init	proved	all subs proved	Inv-main,
Inv-last-inner-size-eq	proved	all subs proved	Inv-last-inner,
Inv-last-inner-reduce	proved	all subs proved	Inv-last-inner,
Inv-last-inner-j-le-i	proved	all subs proved	Inv-last-inner,
Inv-last-inner-init-b	proved	all subs proved	Inv-last-inner, Inv-first-inner,
Inv-last-inner-init-a	proved	all subs proved	Inv-last-inner, Inv-first-inner,
Inv-first-inner-size-eq	proved	all subs proved	Inv-first-inner,
Inv-first-inner-reduce	proved	all subs proved	Inv-first-inner,
Inv-first-inner-j-le-i	proved	all subs proved	Inv-first-inner,
Inv-first-inner-init-b	proved	all subs proved	Inv-first-inner, Inv-main,
Inv-first-inner-init-a	proved	all subs proved	Inv-first-inner, Inv-main,
Inv-end-size-eq	proved	all subs proved	Inv-end,
Inv-end-reduce	proved	all subs proved	Inv-end,
Inv-end-j-le-i	proved	all subs proved	Inv-end,
Inv-end-init	proved	all subs proved	Inv-end, Inv-main,
Inv-last-inner	axiom
Inv-first-inner	axiom
Inv-main	axiom
Inv-end	axiom