Proof P by premises $(\neg P\vee Q)\to P$ I have to proof next question by a formal proof that when the premise is equal to:
$(\neg P\vee Q)\to P$ has the result ,$P$, I first though that I must write:
$\neg P\vee Q\to P$, as:
$\neg(\neg P\vee Q)\vee P$ and work further from there.
The problem is that I only may use Reit ,introduction and Elimination. Can someone help me?

First of all ,you should know that implication connector does not have disribution property on right hand side.
$(\neg P \lor Q)\rightarrow P$ is equal to $(\neg P \rightarrow P)\land (Q\rightarrow P)$
$(\neg P \rightarrow P)\land (Q\rightarrow P)$ $\equiv$ $( P \lor P)\land (\neg Q\lor P)$
So, $P \land (\neg Q\lor P)$ , by elimination
$\therefore P$
