I need to show that in $R^n$ : Convex implies Connected
I try to prove the contrapositive. Disconnected sets cannot be convex. A is a disconnected set. Assume A is convex. $A = B \cup C$ where B and C are non empty disjoint open sets. As they are non-empty I can pick $b \in B$ and $c \in C$. As B is open, there exists $x>0$ such that $B(b,x) \subseteq B$ (open ball contained in B). As C is open, there exists $y>0$ such that $B(c, y) \subseteq B$ (open ball contained in C). We consider $$ t = \frac{x}{x+y}$$ $t \in (0,1)$. By convexity of A, $m=tb+(1-t)c \in A$. As B and C are disjoint there are two possible cases.
Case 1: $m \in C$ and $m \notin B$ Case 2: $m \in B$ and $m \notin C$ I feel like both should lead to a contradiction but I'm not sure how to proceed. I don't think B and C are necessarily convex but I probably need to use that and the fact that we're operating in an Euclidean space but can't think of anything. Thank you so much in advance!!
P.S. I cannot use path-connectedness at this point in the textbook so I cannot rely on the other post about this. Sorry!