[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 ubi-io-inv

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:
ubi-io-inv-extract	proved	all subs proved	peb-inv, inv,
ubi-io-initial-imp-inv	proved	all subs proved	inv, peb-inv, peb-initial, initial,
reduce-initial	proved	all subs proved	peb-inv, peb-initial, initial,
reduce	proved	all subs proved	peb-inv, inv,
peb-inv-write-vidhdr	proved	all subs proved	peb-inv,
peb-inv-write-echdr	proved	all subs proved	peb-inv,
peb-inv-size	proved	all subs proved	peb-inv,
peb-inv-markbad	proved	all subs proved	peb-inv,
peb-inv-empty-vidhdr	proved	all subs proved	peb-inv,
peb-inv-empty-echdr	proved	all subs proved	peb-inv,
inv-size	proved	all subs proved	peb-inv, inv,
initial	axiom
peb-initial	axiom
inv	axiom
peb-inv	axiom