A relation $R\colon A\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}B$ is total if, for each $a\in A$, we have $R\webleft (a\webright )\neq \emptyset $.
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.
A relation $R\colon A\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}B$ is total if, for each $a\in A$, we have $R\webleft (a\webright )\neq \emptyset $.
