[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 real-supinf

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:
inf-uniqueprovedall subs proved lowerbound-def, boundedge-def,
boundedge-neg-boundedleprovedall subs proved upperbound-def, boundedle-def, lowerbound-def, boundedge-def,
lowbound-neg-upperboundprovedall subs proved upperbound-def, lowerbound-def,
inf-existsprovedall subs proved upperbound-def, boundedle-def, sup-exists, lowerbound-def, boundedge-def,
sup-uniqueprovedall subs proved upperbound-def, boundedle-def,
inf-neg-supprovedall subs proved sup-upperbound, inf-highest-lowerbound, inf-lowerbound, upperbound-def, boundedle-def, sup-lowest-upperbound, lowerbound-def, boundedge-def,
sup-lowest-upperboundaxiom
inf-lowerboundaxiom
inf-highest-lowerboundaxiom
sup-upperboundaxiom
sup-existsaxiom
boundedle-defaxiom
upperbound-defaxiom
boundedge-defaxiom
lowerbound-defaxiom