[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 can-refines-traceprop

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:
lemma_2-9-4provedall subs proved lemma-2-8-3,
lemma_2-9-3provedall subs proved lemma-2-8-3,
lemma-2-8-4provedall subs proved behcan-traceprop, lemma-2-8-2, lemma-2-8-3,
lemma-2-8-3provedall subs proved lemma-2-8-2, behcan-limitclosed, behcan-traceprop,
lemma_2-9-3-fwsimprovedall subs proved lemma_2-9-3-fwsim-aux,
lemma_2-9-2provedall subs proved lemma-2-8-2,
lemma_2-9-3-fwsim-auxprovedall subs proved
behcan-tracepropprovedall subs proved
behcan-limitclosedprovedall subs proved
lemma-2-8-2provedall subs proved