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

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:
rtc-oneprovedall subs proved rtc1, rtc,
rtc1provedall subs proved rtc-base, rtc-rec,
rtc-transprovedall subs proved rtc-rec, rtc-base, rtc,
rtc-reflprovedall subs proved rtc-base, rtc,
rtc-lastprovedall subs proved rtc-base, rtc-rec,
rtcaxiom
rtc-recaxiom
rtc-baseaxiom