coq-pigeonhole-principle

This library provides a stand-alone proof of the Pigeonhole principle. The Pigeonhole principle is a fundamental theorem that is used widely in Computer Science and Combinatorics, it asserts that if you put n things into m containers, and n > m, then at least one of the containers contains more than one thing. For more information about this proof, Please read its Readme file, which can be found here: https://github.com/llee454/pigeons

opam install coq-pigeonhole-principle.1.0.3
homepage
https://github.com/llee454/pigeons
license
LGPLv3
bugs tracker
https://github.com/llee454/pigeons/issues
dependencies
coq >= 8.8
source
https://github.com/llee454/pigeons/archive/v1.0.3.tar.gz
package
https://github.com/coq/opam-coq-archive/tree/master/released/packages/coq-pigeonhole-principle/coq-pigeonhole-principle.1.0.3