[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 restricted-refine-implies-forward

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:
refine-and-cstepdet-implies-forwardprovedall subs proved refine-and-cstepdet-implies-forward-aux,
refine-and-cstepdet-implies-forward-auxprovedall subs proved maxfrag-exists,
maxfrag-existsprovedall subs proved iteratest-rec, iteratest-base,
refine-and-adet-implies-forwardprovedall subs proved refine-and-adet-implies-forward-aux,
refine-and-adet-implies-forward-auxprovedall subs proved
iteratest-baseaxiom
iteratest-recaxiom