I have been reading the fourth chapter of Velleman's How to prove book and this is the definition for domain which I have encountered:
Suppose $R$ is a relation from $A$ to $B$. The the domain of $R$ is the set
$ Dom(R) = \{ a \in A | \exists b \in B ((a,b) \in R)\}$
Now what is $ \exists b \in B ((a,b) \in R)$ in the above logical expression ?
Is it equivalent to $ \exists b \in B \land (a,b) \in R$ ?
For a "formal" treatment, we have to start from the concept of ordered couple : $\langle x, y \rangle$.
The we have the definition of relation :
From it, we can define the domain $Dom(R)$ of a relation $R$ :
From this, it follows that :
In general, we have to note that the "set abstraction" symbol $\{ \, \, \mid \, \, \}$ has the property :
Thus, if $R$ is a relation from $A$ to $B$, i.e. $R \subseteq A \times B$, we have that :