[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 buffer-inf-conv

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:
from-to-restprovedall subs proved from-empty, finp-buf, tostream-size,
from-emptyprovedall subs proved finp-buf, tostream-size,
tobufprovedall subs proved tostream-at, tobuf-at, tostream-size, tobuf-size, finp-buf,
finp-bufprovedall subs proved tobuf-disj,
emptystream-cancelprovedall subs proved from-emptystream, split-prefix-append-to, emptystream, at-emptystream,
tobuf-disjprovedall subs proved tostream-size,
at-emptystreamprovedall subs proved emptystream,
from-emptystreamprovedall subs proved emptystream,
tostream-to-sameprovedall subs proved tostream-at, tostream-size,
tostream-injprovedall subs proved tostream-at, tostream-size,
tobuf-revprovedall subs proved tobuf-at, tostream-at, tobuf-size, tostream-size,
tobuf-emptyprovedall subs proved tobuf-size,
buf-emptyprovedall subs proved tostream-size,
tobuf-sizeaxiom
tobuf-ataxiom
tostream-ataxiom
split-prefix-append-toprovedall subs proved
tostream-sizeaxiom
emptystreamaxiom