Let $a
To prove that $b$ is an upper bound, consider $t$, $t \in T$, since intersection of $Q$ and $[a,b]$ is simply the set $T'=[x \in Q : a \le x \le b]$, therfeore, for every value of $t \in T$, $b \ge t$, hence, $b$ is upper bound of $T$.
To prove second part, let $r$ be some upper bound of $T$, then $t \le r$ for all $t \in T$. Since, $r$ is upper bound of $T$ and $b$ is element of $T$, therefore, $b \le r$. Therefore, $b$ is least upper bound. Proof complete.
I know it is a work of rookie but I am learning. Please suggest if I am wrong somewhere, and also help me out by suggesting precise mathematical language wherever I could have used to make it look really like a proof.