Axiom of Replacement
Once we have ordered pairs (which we got in the last post), we are ready to define all kinds of important mathematical objects. The most obvious one is probably the product of two sets and . The definition is pretty straightforward: However, we should ask ourselves if this is a set: as far as we know it, there is nothing preventing this one from being a proper class! So, as you might've guessed, we solve our problems by declaring new axioms. 😎 I'll now try to describe Axiom of Replacement , which should (together with our old axioms) imply that is a set. Remember that we had the notion of a predicate . What we meant here was a property that a set may or may not have. Very similarly, we can consider a property that the ordered pair of sets and may or may not have. One way to think about it is that we can look at some predicate such that ...