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

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:
wfinv-noethindprovedall subs proved wf-noethind, wfinv-def,
twfinv-irreflprovedall subs proved wfinv-irrefl, twfinv-def,
wf-lexicalindprovedall subs proved wf-equiv-noethind, wf-lexical,
twfinv-noethindprovedall subs proved wfinv-equiv-noethind, trans-def, twfinv-def,
wfinv-equiv-noethindprovedall subs proved wf-equiv-noethind, wfinv-def,
wf-lexicalprovedall subs proved wf-equiv-noethind,
wfinv-irreflprovedall subs proved wf-irrefl, wfinv-def,
wf-noethindprovedall subs proved wf-equiv-noethind,
twf-irreflprovedall subs proved wf-irrefl, twf-def,
twf-noethindprovedall subs proved wf-equiv-noethind, trans-def, twf-def,
wf-equiv-noethindprovedall subs proved wf-def,
wf-irreflprovedall subs proved wf-def,
twfinv-transprovedall subs proved trans-def, twfinv-def,
twf-transprovedall subs proved trans-def, twf-def,
trans-defaxiom
twfinv-defaxiom
twf-defaxiom
wf-defaxiom
wfinv-defaxiom