[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 finitedepth-trees-gen

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:
well-foundedprovedall subs proved order-def, findepth-nocycle, irreflexive, findepth-def,
irreflexiveprovedall subs proved nocycle-def, order-def,
findepth-nocycleprovedall subs proved findepth-def, nocycle-def,
well-founded-indprovedall subs proved order-def, findepth-def,
unique-rootprovedall subs proved rooted-def,
transitiveprovedall subs proved order-def,
rooted-defaxiom
order-defaxiom
nocycle-defaxiom
findepth-defaxiom