Soccer Tournament Statement to Symbolic Forms

50 Views Asked by At

Suppose there is a tournament involving $b$ teams where $b \ge 2$. It is viable to name the teams as $T_1, T_2, \cdots T_b$ so that $T_r$ beats $T_{r+1}$ for any $r$ from $1$ to $b-1$.

Here is what I've done

$\forall r \in \{1,\cdots, b-1\}$, $T_r$ beats $T_{r+1}\iff b \ge 2$

Is this the correct way to write the symbolic form of the above statement?