I just wanted to check if this proof works, as I couldn't find anything online. Thanks!
A relation is complete: $(_xR_y) \cup (_yR_x)\; \forall x,y \in X $
A relation is reflexive: $(_xR_x) \; \forall x \in X $
Proof by contradiction that completeness implies reflexivity
Let's assume R is complete, and not reflexive, i.e. $\exists \, x' \in X, s.t. \; x'\not\mathrel{R} x' $
Then using completeness we must have $(x'Ry) \cup (yRx')$.
Setting $x' = y$ we have our desired contradiction. As we must have $x'Rx'$
My only concern with this is that given the definition of completeness, $(_xR_y) \cup (_yR_x)\; \forall x,y \in X $, are we aloud to assume $x = y$? Thanks!