I am new to proofs.
Let $A$ be a relation on $\mathbb{R}$.
Reflexivity: For all $x\in\mathbb{R}, x \leq x$.
Proof: Let $x$ be an element of A. Clearly, $x$ will always equal itself.
This clearly needs more work, but I am having a hard time moving further.
Antisymmetric: For all $x,y\in\mathbb{R}$, if $x\leq y$ and $y\leq x$, then $x=y$.
Proof: Suppose that $x\neq y$. Then, there is some element $x$ and $y$, where $x<y$ or $x>y$. If $x<y$, then clearly $x\not> y$. Similarly, if $y<x$, then clearly $y\not> x$. Thus, $x$ must equal $y$ if $x\leq y$ and $y\leq x$.
I felt like I did some circular logic here; please help.
Transitivity: I have not attempted this yet. I wanted to make sure I had the right approach on my previous proof.
You cannot let A be just any relation for R
and expect to prove anything much about A.
If you defined A = { (x,y) : x,y in R, x <= y },
then useful propositions about A could be proved.
To proceed, how are you defining x <= y?
A definition is needed to prove anything about it.
One definition is:
x <= y when exists nonnegative d with x + d = y.
Showing reflectivity requires knowing 0 is nonnegative.
Showing transitivity requires knowing the sum of two nonnegative numbers is nonnegative.
Showing antisymmetricity requires knowing that if the
sum of two nonnegative numbers is 0, then they both are.
How does your text book define <=?