Is there a repository for the hierarchy of proofs?

Question

I am self-learning proof assistants and decided to start on some basic proofs and work my way up. Since proofs are based on other proofs and so form a hierarchy, is there a repository of the hierarchy of proofs?

I know I can pick a particular proof-assistant and analyze its library to extract its hierarchy, however if I want to find the next proof in a chain to prove, I can't when it is not in the library.

In my mind I picture a graph, probably a DAG, of all of the known mathematical proofs that can be expressed using English statements, not proofs using pictures. This would be the master map (a map in the sense of starting at one point and traveling to another point via intermediate points), and for a particular proof assistant, one would have a subgraph of the master map. Then if one wanted to create a proof using a proof assistant found on the master not on the subgraph, by comparing the two graphs one could get an idea of the work needed to create the missing proof(s) for the proof assistant.

I am aware that mathematical proofs are not necessarily easily convertable for use with a proof assistant, however having a general idea of what to do is much better than none at all.

Also by having the master map, I can see if there are mulitple paths from one point to antoher and choose a path that is more amenable for the particualr proof assistant.

EDIT

In searching I found something similar for mathematical functions. I did not find one for proofs at the NIST

Answer 1

The Mizar system is a huge repository of math proofs. See the wikipedia page and the official website.

of all of the known mathematical proofs that can be expressed using English statements

From wikipedia/Mizar_system#Mizar_language:

The distinctive feature of the Mizar language is its readability

Proofs are written as articles, of which there are more than a thousand articles, and more than 50,000 proven theorems. The wikipedia page mentions some interesting ideas of the "QED manifesto", and how Mizar might be on its way to accomplishing this.

• A huge graph of the Mizar library.
• This paper might also be helpful: Combining Mizar and TPTP Semantic Presentation Tools by Josef Urban, Steven Trac, Geoff Sutcliffe, Yury Puzis (Wayback Machine)

Answer 2

ProofWiki contains a decent amount of proofs from various areas of mathematics. It is by no means complete, but is a good starting point for what you want.

Answer 3

Metamath has a large selection of proofs, built right up from their core in propositional logic.

That said, it is painfully lacking in terms of CS theory. Feel free to expand it!

Answer 4

See the TPTP archive, Thousands of Problems for Theorem Provers. It is somewhat standard in the field. This is more the "nodes" of the theorem graph you are asking about. Some papers referring to the archive may have explored the edges in this graph.

Note that in the field of ATM, automated theorem proving and assisted theorem proving, the proofs are symbolic and it's not really feasible or plausible to study "proofs in the English language" as you visualize.

However you might learn about Richard's paradox which started out as a language formulation and was later formalized symbolically. It is said to be the inspiration for "antimonies" (contradictions) found in early set theory which historically even paved the way to Gödel's incompleteness theorem.