Description: Define unordered pair of
classes. Definition 7.1 of [Quine] p. 48. For
example, 𝐴 ∈ {1, -1} → (𝐴↑2) = 1 (ex-pr 28803). They are
unordered, so {𝐴, 𝐵} = {𝐵, 𝐴} as proven by prcom 4669. For a more
traditional definition, but requiring a dummy variable, see dfpr2 4581.
{𝐴,
𝐴} is also an
unordered pair, but also a singleton because of
{𝐴} =
{𝐴, 𝐴} (see dfsn2 4575). Therefore, {𝐴, 𝐵} is called
a proper (unordered) pair iff 𝐴 ≠ 𝐵 and 𝐴 and 𝐵 are
sets.
Note: ordered pairs are a completely different object defined below in
df-op 4569. When the term "pair" is used
without qualifier, it generally
means "unordered pair", and the context makes it clear which
version is
meant. (Contributed by NM, 21-Jun-1993.) |