> But when we removed h_1, we got that all the remaining horses had the same color as h_2. So h_2 must also be brown.
Right, but for transitivity you actually need there to be a third horse to connect h_1 and h_2. i.e. for this logical chain, you need "all the remaining horses" to be a non-empty set.
> But when we removed h_1, we got that all the remaining horses had the same color as h_2. So h_2 must also be brown.
Right, but for transitivity you actually need there to be a third horse to connect h_1 and h_2. i.e. for this logical chain, you need "all the remaining horses" to be a non-empty set.