中文 👈
This project is a Coq formalization of the textbook Elements of Set Theory - Herbert B. Enderton. It is basically written in the order of the textbook, without considering modularity. It is suitable as an aid to the learning of set theory, not as a general mathematical library.
Coq 8.13.2
make
- Law of excluded middle
- Church's iota operator
- Informative excluded middle
- Decidable inhabitance of type
- Axiom of extensionality
- Axiom of empty set
- Axiom of union
- Axiom of power set
- Axiom schema of replacement
- Pair
- Singleton
- Binary union
- Union of a family of sets
- Set comprehension
- Intersaction, binary intersaction
- Ordered pair
- Cartesian product
- Axiom of infinity
- Axiom of choice
- Complement
- Proper subset
- Algebra of sets
- Relation, function
- Inverse, composition
- Injection, surjection, bijection
- Left inverse and right inverse of function
- Restriction, image
- Function space
- Infinite Cartesian product
- Binary relation
- Equivalence relation, equivalence class, quotient set
- Trichotomy, linear order
- Natural number
- Induction principle
- Transitive set
- Peano structure
- Recursion theorem
- Embedding of type-theoretic nat
- Natural number arithmetic: addition, multiplication, exponentiation
- Linear ordering of ω
- Well ordering of ω
- Strong induction principle
- Integer
- Integer arithmetic: addition, additive inverse
- Multiplication of integers
- Order of integers
- Embedding of the natural numbers
- Rational number
- Rational number arithmetic: addition, additive inverse, multiplication, multiplicative inverse
- Order of rational numbers
- Embedding of the integers
- Algebra regarding to inverse
- Real number (Dedekind cut)
- Order of real numbers
- Completeness of the real numbers
- Real number arithmetic: addition, additive inverse
- Absolute value of real number
- Multiplication of non-negative real numbers
- Multiplicative inverse of positive real number
- Arithmetic of rational numbers: multiplication, multiplicative inverse
- Embedding of the rational numbers
- Density of the real numbers
- Equinumerous
- Cantor's theorem
- Pigeonhole principle
- Finite cardinal
- Infinite cardinal
- Cardinal arithmetic: addition, multiplication, exponentiation
- Dominate
- Schröder–Bernstein theorem
- Order of cardinals
- Aleph Zero
- Systematic discussion on AC
- Uniformization
- Infinite Cartesian product of nonempty sets is nonempty
- Choice function
- Cardinal comparability
- Zorn's lemma
- Tukey's lemma
- Hausdorff maximal principle
- Aleph Zero is the least infinite cardinal
- Dedekind infinite
- Infinite sum of cardinals
- Infinite product of cardinals
- Countable set
- Countable union of countable sets is countable
- Algebra of infinite cardinals
- Cardinal multiplied by itself equals to itself
- Absortion law of cardinal addition and multiplication
- Partial order, linear order
- Minimal, minimum, maximal, maximum
- Bound, supremum, infimum
- Well order
- Transfinite induction principle
- Transfinite recursion theorem
- Transitive closure of set
- Order structure
- Isomorphism
- Epsilon image
- Ordinal
- Order of ordinals
- Burali-Forti's paradox
- Successor ordinal, limit ordinal
- Transfinite induction schema on ordinals
- Hartog's number
- Equivalence among well order theorem, AC and Zorn's lemma
- von Neumann cardinal assignment
- Initial cardinal, successor cardinal
- Transfinite recursion schema on ordinals
- von Neumann universe
- Rank
- Axiom of regularity
- Ordinal class
- Ordinal operations
- Subclass separation
- Normal operation
- Aleph number
- Beth number
- Properties of ordinal operations
- Veblen fixed-point theorem
- Enumeration of fixed-point is normal operation
- There exist fixed-point of fixed-point
- Order types
- Addition of order types
- Multiplication of order types
- Laws of order type arithmetic
- Order type arithmetic on well-ordered structure
- Ordinal Arithmetic (defined as order type arithmetic)
- Addition, multiplication
- Ordinal Arithmetic (defined by recursion)
- Addition, multiplication, exponentiation
- Tetration, epsilon numbers
- Solution to exercises of Chapter n