A Silly Question

(This is sort of an fun intro to proof by contradiction.)

Assume the set of boring integers $\mathbf{B}$ exists.

Denote $\lbrace |n| \in \mathbb{N}: n \in \mathbf{B} \rbrace$ (the set of all $|n|$ such that $n \in \mathbf{B}$ ) by $\mathbf{B}^{*}$ and let $\min \mathbf{B}^{*} = b$ : this property of $b$ being a minimum of $\mathbf{B}^{*}$ is certainly non-boring, and so $b \in \mathbf{B}$ is false. However, this is a contradiction, and so it follows that the set of boring integers $\mathbf{B}$ does not exist.