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

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:
insert-rec-correctprovedall subs proved abs-sym, hash-same, disj-reduce, inv-reduce, less, size, disj-neq, at-put, hash-given, in-abs,
insert-correctprovedall subs proved less, disj-neq, hash-same, disj-reduce, size, inv-reduce, hash-given, at-put, in-abs,
inv-reduceprovedall subs proved inv, size,
abs-symprovedall subs proved in-abs,
at-putprovedall subs proved inv,
hash-givenprovedall subs proved inv,
sizeprovedall subs proved inv,
disj-reduceprovedall subs proved disj,
hash-sameprovedall subs proved inv,
disj-neqprovedall subs proved disj,
lessprovedall subs proved inv,
lookup-correctprovedall subs proved in-abs,
disjaxiom
invaxiom
in-absaxiom