Artificial intelligent assistant

Prove implication sequent I need to prove the sequent $P \to Q \vdash \neg P \lor Q$ without using the law of the excluded middle $(P \lor \neg P)$ or $( Q \lor \neg Q)$.

Here is a proof done in Fitch:

![enter image description here](

xcX3v84RxoQ-4GxG32940ukFUIEgYdPy a9a5f3645161747ce4b2501b052ac0c9