[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 suffix-array

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:
valid-sar-twice-same1	proved	all subs proved	valid, valid-sar-twice-same,
valid-sar-twice-same	proved	all subs proved	sar-elems-bagle-twice-same, sar-elems-bagle-size, valid,
valid-sar-at-le	proved	all subs proved	sar-elems-bagle-ls, sar-elems-bagle-size, valid,
valid-sar-at-ls	proved	all subs proved	sar-elems-bagle-ls, sar-elems-bagle-size, valid,
sar-elems-bagle-ls	proved	all subs proved	bagle-in, sar-elems-bagle-size,
sar-elems-bagle-twice-same	proved	all subs proved	bagle-count, sar-elems-bagle-size,
valid-suffix-ls	proved	all subs proved	sar-elems-bagle-size, valid,
valid-sar-size	proved	all subs proved	sar-elems-bagle-size, valid,
valid-sar-index-exists	proved	all subs proved	bagle-in, sar-elems-bagle-size, valid,
sar-elems-bagle-size	proved	all subs proved	bagle-size,
bagle-in	proved	all subs proved	bagle-count,
bagle-size	proved	all subs proved	bagle-rec, bagle-base,
bagle-count	proved	all subs proved	bagle-rec, bagle-base,
valid	axiom
bagle-base	axiom
bagle-rec	axiom