[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 BSPs

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:
SD-implies-SRprovedall subs proved BSP_SD-def, BSP_SR-def,
SD-implies-BSDprovedall subs proved BSP_SD-def, BSP_BSD-def,
SD-equiv-BSD-N2Vprovedall subs proved BSP_BSD-def, BSP_SD-def,
BSRA-implies-RAprovedall subs proved BSP_BSRA-def, BSP_RA-def,
BSD-implies-Dprovedall subs proved BSP_BSD-def, BSP_D-def,
BSP_SR-defaxiom
BSP_SD-defaxiom
BSP_RA-defaxiom
BSP_BSRA-defaxiom
BSP_D-defaxiom
BSP_BSD-defaxiom