Ordinal sum does not respect equivalence on the left #
The theorem IGame.ordinalSum_right_congr tells us that if b₁ ≈ b₂, then a ∶ b₁ ≈ a ∶ b₂ for
any game a. We show that this does not hold for the left argument by providing an explicit
counterexample. If a₁ = {-1 | 1}, a₂ = 0, and b = 1, then a₁ ≈ a₂ but a₁ ∶ b ≉ a₂ ∶ b. (In
fact, the LHS is equivalent to ½, while the RHS is equivalent to 1).