We have $A\to B$ and $A\to C$. I need counter-examples to: '$\therefore B\to C$'.
More formally, disprove:
$$ (A\to B)\land(A\to C)\to (B\to C)$$
I have $A$ is a blackbird, $B$ is 'is black', $C$ is 'is a bird', and so $B \not\to C$. Does anyone have a more numerical solution?
(alternatively, cases where this is true...)
\begin{align} \mathcal A & = \{5,6\} \\ \mathcal B & = \{1,2,3,4,5,6\} \\ \mathcal C & = \{3,4,5,6,7,8,9,10\} \\[12pt] A & = [x\in\mathcal A] \\ B & = [x\in\mathcal B] \\ C & = [x\in\mathcal C] \end{align}
Then $A\to B$ and $A\to C$ are true but $B\to C$ is false.
Second example: \begin{align} A & = [x\in\{1,2,3,4,\ldots\}] \\ B & = [x \text{ is rational}] \\ C & = [x>0] \end{align}