[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 int-inf

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:
less-reflex-revprovedall subs proved irreflex,
less-reflexprovedall subs proved irreflex,
irreflexprovedall subs proved less-int, not-inf-less, neginf-less,
transprovedall subs proved less-int, neginf-less, not-inf-less, less-inf, not-less-neginf,
antisymprovedall subs proved less-int, not-less-neginf, less-inf, not-inf-less, neginf-less,
neginf-lessaxiom
not-inf-lessaxiom
less-infaxiom
not-less-neginfaxiom
less-intaxiom