A bit of an application question....
In specialist maths, if told to "prove" something what should I do first? This is the first time I've encountered a "prove that" question in my textbook questions which is under the preliminary topics section... lol, this is the first time I'm doing modulus functions 
The question is: Prove that |x-y| is greater than/equal to |x| + |y|
This is not the only "prove that" question, there's 2 more after it and then I've done the whole chapter... 
I have spesh tomorrow so I'll ask any questions I have to my a-maze-zinga teacher
but wanted a bit of insight into how to even attempt these questions
On a more "newbie" question: for each of the following, illustrate the set on the number line and represent the set using interval notation: C) {x : |x-2|</equal to 1}
I was okay with questions like this: {x : |x| < 3} but I'm thrown off. What should I do?
Thank you
Ah proofs, proofs are the real deal in mathematics and make them a lot more fun

How do we prove a theorem is true? Unfortunately there are usually no direct method when it comes proving theorems, such as applying a formula, and involves a bit of trial-and-error.
Usually for proofs, you'll be given a statement and asked to prove a certain property of that statement, like |x+y| being less than or equal to |x| + |y| (You've got it the other way round by the way, this is called the
triangular inequality). For specialist, these two methods of proofs will be sufficient:
1) Direct Proof
2) Proof by cases
Generally for proving questions, start off by listing down what you know is true, like for |x+y|, we know both x and y are real numbers (or possibly complex), then we also know the properties of real numbers, such as a+b=b+a etc. With this, try to see if you apply what is already known to be true, and show that |x+y| is indeed less than or equal to |x|+|y|. To do so you can apply the method of proofs I've listed out earlier. For absolute values, it's a good idea to do by cases.
Other method of proofs, but not limited to, include:
- Contrapositive
- Proof by contradiction
- Mathematical Induction
To understand proofs better and how it can be used, I've listed 4 different proofs for a different theorem where the sum of the first
n odd number equals
n squared here in my blog:
http://www.nerdofpassion.com/blog/fun-with-maths-4-ways-to-prove-that-the-sum-of-the-first-n-odd-numbers-equals-to-n-squared for you to check out!
Hope this helps!