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

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:
below-empty-rem-emptyprovedall subs proved below-rem-in, below-rem-notin,
below-rem-notinprovedall subs proved in-below,
below-rem-inprovedall subs proved in-below,
in-usedprovedall subs proved in-used-h, used-ecs,
in-freeprovedall subs proved in-free-h, free-ecs,
below-nonemptyprovedall subs proved in-below,
in-used-hprovedall subs proved used-ecs-rec, used-ecs-base,
in-free-hprovedall subs proved free-ecs-rec, free-ecs-base,
in-belowprovedall subs proved below-rec, below-base,
same-used2-idexptprovedall subs proved same-used,
same-used-sameprovedall subs proved same-used,
same-used-idexptprovedall subs proved same-used,
same-used-extractprovedall subs proved same-used,
same-usedaxiom
used-ecs-baseaxiom
used-ecs-recaxiom
used-ecsaxiom
free-ecs-baseaxiom
free-ecs-recaxiom
free-ecsaxiom
below-baseaxiom
below-recaxiom