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: |
|---|
| finz-add-neq | proved | all subs proved
| finz-add-notless,
finz-add-bigger,
|
| finz-add-notleq | proved | all subs proved
| finz-add-notless,
|
| finz-add-notless | proved | all subs proved
| finz-add-bigger,
|
| rew-finz | proved | all subs proved
| finz-bounded-02,
|
| finz-bounded-04 | proved | all subs proved
| finz-bounded-02,
finz-bounded,
|
| finz-bounded-01 | proved | all subs proved
| finz-bounded,
|
| finz-add-leq | proved | all subs proved
| finz-add-bigger,
|
| finz-bounded-02 | proved | all subs proved
| split-unique-2,
split-ok,
|
| finz-bounded | proved | all subs proved
| lead-is-odd,
split-ok,
|
| finz-add-bigger | proved | all subs proved
| pot2-even,
pot2-odd,
lead-is-odd,
split-ok,
|
| lead-notzero | proved | all subs proved
| lead-is-odd,
|
| pot2-even | proved | all subs proved
| pot2-odd,
|
| split-unique-2 | proved | all subs proved
| finz-odd,
lead-odd,
finz-even,
lead-even,
|
| split-ok | proved | all subs proved
| lead-odd,
finz-odd,
lead-even,
finz-even,
|
| lead-is-odd | proved | all subs proved
| lead-odd,
lead-even,
|
| split-unique | proved | all subs proved
| lead-odd,
finz-odd,
lead-even,
finz-even,
|
| finz-bounded-05 | proved | all subs proved
| finz-odd,
finz-even,
|
| finz-bounded-03 | proved | all subs proved
| finz-odd,
finz-even,
|
| finz-bigger | proved | all subs proved
| finz-odd,
finz-even,
|
| lead-even | axiom | | |
| lead-odd | axiom | | |
| finz-even | axiom | | |
| finz-odd | axiom | | |
| pot2-odd | proved | all subs proved
| |