How to match implication without prior intros?

I am trying to write a tactic to check if my goal is an implication without having to introduce anything beforehand.

How can I prove that theorem in coq: (x | a) -> (x | b) -> x <= (gcd a b)?

I have this realization of greatest common divisor: