[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 valid-peb

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-peb0-write-appendprovedall subs proved subarray-add-eq-mkempbuf, valid-peb2, valid-peb0,
valid-peb0-vidhdr-garbageprovedall subs proved valid-peb2, valid-peb0,
valid-peb0-vidhdr-emptyprovedall subs proved valid-peb2, valid-peb0,
valid-peb0-valid-vidhdrprovedall subs proved valid-peb2, valid-peb0,
valid-peb0-invalid-vhdrprovedall subs proved valid-peb2, valid-peb0,
valid-peb0-invalid-ehdrprovedall subs proved valid-peb2, valid-peb0,
valid-peb0-imp-valid-pebprovedall subs proved valid-peb0, valid-peb2,
valid-peb0-badprovedall subs proved valid-peb2, valid-peb0,
valid-peb-volprovedall subs proved valid-peb2,
valid-peb-vidhdr-garbageprovedall subs proved valid-peb2,
valid-peb-vidhdr-emptyprovedall subs proved valid-peb2,
valid-peb-valid-vidhdrprovedall subs proved valid-peb2,
valid-peb-uniqueprovedall subs proved valid-peb2,
valid-peb-lebprovedall subs proved valid-peb2,
valid-peb-imp-valid-peb0provedall subs proved valid-peb0, valid-peb2,
valid-peb-badprovedall subs proved valid-peb2,
not-valid-peb2-explicit-0provedall subs proved valid-peb2, valid-peb0,
subarray-add-eq-mkempbufprovedall subs proved
valid-peb0axiom
valid-peb2axiom