2023-04-30

262: Finite Product of Sets Is Set

<The previous article in this series | The table of contents of this series | The next article in this series>

A description/proof of that finite product of sets is set

Topics


About: set

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that the product of any finite number of sets is a set.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Description


For any sets, S1,S2,...,Sn, the product of the sets, S1×S2×...×Sn, is a set.


2: Proof


1st, let us think of the case in which n=2. In fact, S1×S2={sPow(Pow(S1S2))|s1S1,s2S2,s=s1,s2}, because siS1S2,{s1}S1S2, so,{s1}Pow(S1S2),{s1,s2}S1S2, so,{s1,s2}Pow(S1S2),{{s1},{s1,s2}}=s1,s2Pow(S1S2), so,s1,s2Pow(Pow(S1S2)). By the subset axiom and the proposition that some expressions can be parts of legitimate formulas for the ZFC set theory, S1×S2 is a set.

S1×S2,×...×Sn is really (...(S1×S2)×...)×Sn. As S1×S2 is a set, (S1×S2)×S3 is a set; as (S1×S2)×S3 is a set, ((S1×S2)×S3)×S4 is a set; . . .; as (...(S1×S2)×...)×Sn1 is a set, (...(S1×S2)×...)×Sn is a set. Of course, we should use the induction principle to be exact.


References


<The previous article in this series | The table of contents of this series | The next article in this series>