[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 ebm-vol-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:
le-unmap	proved	all subs proved	ebm-vol-inv, ebm-vol-le,
le-size-2	proved	all subs proved	ebm-vol-le,
le-size-1	proved	all subs proved	ebm-vol-le,
le-size-0	proved	all subs proved	ebm-vol-le,
le-refl	proved	all subs proved	ebm-vol-le,
le-mapped	proved	all subs proved	ebm-vol-le,
le-inv	proved	all subs proved	ebm-vol-inv, ebm-vol-le,
ebm-vol-inv-write	proved	all subs proved	ebm-vol-inv,
ebm-vol-inv-lebsize	proved	all subs proved	ebm-vol-inv,
ebm-vol-le	axiom
ebm-vol-inv	axiom