Here you are trying to prove that if then there is no prime that divides both and . The neatest way to do this is by contradiction, suppose that and that there exists prime such that and and derive a contradiction.
Now you are trying to show that if for all primes that and then .(ii) if , then the gcd(a,b) = 1
Once again consider proof by contradiction ..