Subsection 2.3.3 (0032): Pairings of Sets

Preferences

Font:

PDF Style:

Here's a breakdown of the differences between each PDF style:

Style	Class	Font	Theorem Environments
Style 1	`book`	Alegreya Sans	`tcbthm`
Style 2	`book`	Alegreya Sans	`amsthm`
Style 3	`book`	Arno*	`amsthm`
Style 4	`book`	Computer Modern	`amsthm`

*To be replaced with Linus Romer's Elemaints when it is released.

Table of Contents
Part 1: Sets
Chapter 2: Constructions With Sets
Section 2.3: Operations With Sets
Subsection 2.3.3: Pairings of Sets (cite)

2.3.3 Pairings of Sets

Let $X$ and $Y$ be sets.

Definition 2.3.3.1.1 ▶ Pairings of Sets

The pairing of $X$ and $Y$ is the set $\webleft\{ X,Y\webright\} $ defined by

\[ \webleft\{ X,Y\webright\} \mathrel {\smash {\overset {\mathclap {\scriptscriptstyle \text{def}}}=}}\webleft\{ x\in A\ \middle |\ \text{$x=X$ or $x=Y$}\webright\} , \]

where $A$ is the set in the axiom of pairing, of .

Noticed something off, or have any comments? Feel free to reach out!

Email
Twitter
Discord

You can also use the contact form below: