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: |
|---|---|---|---|
| productok-sharedr-not-tau | proved | all subs proved | sharingok-def, productok-def, |
| productok-sharedl-not-tau | proved | all subs proved | sharingok-def, productok-def, |
| PhIOAut | proved | all subs proved | lrexth-def-right, lrexth-def-left, sharingok-def, surj-def, productok-def, lrstart-def, hidingproduct-def, hidingok-def, hidingproductok-def, |
| PCIOAut | proved | all subs proved | sharingok-def, lrext-def-right, lrext-def-left, surj-def, productok-def, lrstart-def, product-def, |
| productok-injrren | proved | all subs proved | productok-def, |
| productok-injlren | proved | all subs proved | productok-def, |
| product-def | axiom | ||
| lrext-def-left | axiom | ||
| lrext-def-right | axiom | ||
| hidingproductok-def | axiom | ||
| hidingok-def | axiom | ||
| hidingproduct-def | axiom | ||
| lrstart-def | axiom | ||
| surj-def | axiom | ||
| lrexth-def-left | axiom | ||
| lrexth-def-right | axiom | ||
| productok-def | axiom | ||
| sharingok-def | axiom |