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: |
|---|
| enc-invert | proved | all subs proved
| dec-int-01,
dec-nat-01,
encode-pair,
dec-snd,
dec-fst,
|
| exencode | proved | all subs proved
| dec-int-01,
dec-nat-01,
encode-pair,
dec-snd,
dec-fst,
|
| injectivity | proved | all subs proved
| sel-fst,
sel-snd,
|
| sel-snd | proved | all subs proved
| dec-int,
dec-nat,
dec-snd,
encode-pair,
|
| sel-fst | proved | all subs proved
| dec-int,
dec-nat,
dec-fst,
encode-pair,
|
| dec-int-01 | proved | all subs proved
| enc-nat-neg,
enc-zero-02,
enc-nat-pos,
dec-nat-pos,
dec-nat-neg,
|
| enc-zero | proved | all subs proved
| enc-zero-01,
enc-zero-02,
enc-int-pos,
encode-pair,
|
| injectivity-01 | proved | all subs proved
| dec-nat,
|
| injectivity-02 | proved | all subs proved
| dec-int,
|
| dec-nat-01 | proved | all subs proved
| enc-int-neg,
enc-int-pos,
dec-int-pos,
dec-int-neg,
|
| dec-nat | proved | all subs proved
| dec-nat-neg,
dec-nat-pos,
enc-nat-pos,
enc-nat-neg,
|
| dec-int | proved | all subs proved
| dec-int-neg,
dec-int-pos,
enc-int-pos,
enc-int-neg,
|
| enc-zero-02 | proved | all subs proved
| enc-nat-pos,
enc-nat-neg,
|
| enc-zero-01 | proved | all subs proved
| enc-int-neg,
enc-int-pos,
|
| dec-fst | axiom | | |
| dec-nat-neg | axiom | | |
| dec-nat-pos | axiom | | |
| dec-snd | axiom | | |
| enc-int-neg | axiom | | |
| dec-int-pos | axiom | | |
| dec-int-neg | axiom | | |
| encode-pair | axiom | | |
| enc-int-pos | axiom | | |
| enc-nat-neg | axiom | | |
| enc-nat-pos | axiom | | |