The above-given form of open sets is not canonical, the assignment
of indices $i$ to the open component intervals is arbitrary. Let's write it in an equivalent but canonical way:
$\quad$ Every open set $\ G\subseteq\mathbb R\ $ is of the form
$$ G\ =\ \bigcup \Gamma $$
where $\ \Gamma $ is a family of pairwise disjoint open intervals. Such family $\ \Gamma\ $ is unique and countable (possibly finite).
Indeed, define a binary relation in $\ G\ $ as follows:
$$ \forall{x,\ y\in G}\quad (\,x\equiv y\,\ \Leftrightarrow
\,\ [\min(x\,\ y);\ \max(x\,\ y)]\ \subseteq G\,) $$
It's clear that
- relation $\ \equiv\ $ is an equivalence relation in $G$,
- every equivalence class of $\ \equiv\ $ is an open convex set,
- every non-empty open convex set $\ D\subseteq\mathbb R\ $ is
an open interval, namely
$$ D\ =\ (\inf D;\sup D) $$
Family $\ \Gamma\ $ is countable because of every
open interval having a rational number as its point (obviously,
any two different equivalence classes do not share any rational number -- after all, different classes are disjoint).
.
That's all.