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: |
|---|
| invmult-r | proved | all subs proved
| multassoc,
multzero-r,
addcom,
addassoc,
addinv-l,
invtwice,
addinv-unique,
distr-r,
|
| trivialring | proved | all subs proved
| multassoc,
multzero-l,
multone-l,
|
| mult-minusone | proved | all subs proved
| multassoc,
multzero-l,
addcom,
addassoc,
addinv-l,
addinv-unique,
multone-l,
distr-l,
|
| invmult-l | proved | all subs proved
| multassoc,
multzero-l,
addcom,
addassoc,
addinv-l,
invtwice,
addinv-unique,
distr-l,
|
| multzero-l | proved | all subs proved
| addassoc,
addcom,
addzero-l,
addinv-l,
invzero,
distr-l,
addinv-r,
|
| invtwice | proved | all subs proved
| addassoc,
addinv-l,
addinv-unique,
addcom,
|
| multzero-r | proved | all subs proved
| distr-r,
addassoc,
addcom,
addinv-l,
addzero-l,
invzero,
|
| invzero | proved | all subs proved
| addcom,
addassoc,
addinv-l,
addzero-r,
|
| addinv-unique | proved | all subs proved
| addzero-l,
addcom,
addassoc,
addinv-l,
|
| zero-unique | proved | all subs proved
| addinv-l,
addcom,
addassoc,
addzero-l,
|
| addzero-l | proved | all subs proved
| addcom,
addassoc,
addzero-r,
|
| addinv-l | proved | all subs proved
| addcom,
addassoc,
addinv-r,
|
| addinv-r | axiom | | |
| distr-l | axiom | | |
| addzero-r | axiom | | |
| multone-l | axiom | | |
| distr-r | axiom | | |
| addassoc | axiom | | |
| addcom | axiom | | |
| multassoc | axiom | | |