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

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:
next-lsprovedall subs proved irreflexivity, transitivity, next, next-neq, loc,
next-neqprovedall subs proved irreflexivity, lel, lel-01, loc, next,
next-neq-01provedall subs proved smallest-01, next,
lelprovedall subs proved transitivity, irreflexivity, loc,
lel-01provedall subs proved transitivity, irreflexivity, loc,
smallest-01provedall subs proved irreflexivity, transitivity, loc, smallest,
nnnprovedall subs proved irreflexivity, transitivity, loc,
nllprovedall subs proved irreflexivity, transitivity, loc,
nen-01provedall subs proved transitivity, irreflexivity, loc,
nenprovedall subs proved transitivity, irreflexivity, loc,
locprovedall subs proved transitivity, irreflexivity, seq,
slsprovedall subs proved irreflexivity, transitivity, seq,
seqprovedall subs proved totality,
exists-notjvmrefprovedall subs proved irreflexivity, no-maximum,
smallestaxiom
totalityaxiom
nextaxiom
transitivityaxiom
no-maximumaxiom
irreflexivityaxiom