Add a proof that the cardinality of Type(u+1) is greater than Type(u) #3244
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
mtzguido
changed the title
This also adds an FStar.Functions module with some reusable definitions about functions and sets. It also splits the proof between the set-theoretic results on functions (due to Cantor, potentially useful without referring to universes) and the result about universes which uses an indexed inductive type.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This also adds an FStar.Functions module with some reusable definitions about functions and sets. It also splits the proof between the set-theoretic results on functions (due to Cantor, potentially useful without referring to universes) and the result about universes which uses an indexed inductive type.